Producing a One-Way Hash Function from DES
Published 1 January 1984
Robert S. Winternitz
Citations55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper deals with compressing messages via a one-way hash function before creating a digital signature using DES, and three previous suggestions for doing this using DES are shown to be insecure.
Abstract
This paper deals with compressing messages via a one-way hash function before creating a digital signature. Three previous suggestions for doing this using DES are shown to be insecure. A fourth suggestion is proposed for further study.
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
IEEE Transactions on Information TheoryNew directions in cryptography
14,441 Citations1976Whitfield Diffie, Martin E. Hellman
Communications of the ACMA method for obtaining digital signatures and public-key cryptosystems
13,142 Citations1983Ronald L. Rivest, Adi Shamir +1 more
Communications of the ACMA method for obtaining digital signatures and public-key cryptosystems
13,083 Citations1978Ronald L. Rivest, Adi Shamir +1 more
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.
ComputerDigital signatures: A tutorial survey
65 Citations1983Aki
This article on digital signature schemes is a survey of work done in the area since the concept was introduced in 1976.
Signatures Through Approximate Representations by Quadratic Forms
22 Citations1984H. Ong, C. P. Schnorr
A signature scheme where the private key is a random (n, n)-matrix T with coefficients in ℤm/mℤ, m a product of two large primes, which is faster than the RSA-scheme and knowledge of this prime decomposition enables forging signatures.