One Way Hash Functions and DES
Lecture notes in computer sciencePublished 1 January 1990
Ralph C. Merkle
Citations872
SJR quartileQ2
SJR score0.35
SNIP0.55
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 work shows three one-way hash functions which are secure if DES is a good random block cipher.
Abstract
One way hash functions are a major tool in cryptography. DES is the best known and most widely used encryption function in the commercial world today. Generating a one-way hash function which is secure if DES is a "good" block cipher would therefore be useful. We show three such functions which are secure if DES is a good random block cipher.
Keywords
Computer Science
Bell System Technical JournalCommunication Theory of Secrecy Systems*
9,330 Citations1949Claude E. Shannon
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)Cryptography and data security
1,911 Citations1982Dorothy E. Denning
The goal of this book is to introduce the mathematical principles of data security and to show how these principles apply to operating systems, database systems, and computer networks.
Lecture notes in computer scienceA Digital Signature Based on a Conventional Encryption Function
1,803 Citations1988Ralph C. Merkle
A new digital signature based only on a conventional encryption function (such as DES) is described which is as secure as the underlying encryption function -- the security does not depend on the difficulty of factoring and the high computational costs of modular arithmetic are avoided.
Lecture notes in computer scienceA Certified Digital Signature
1,690 Citations2007Ralph C. Merkle
A practical digital signature system based on a conventionalryption function which is as secure as the conventional encryption function is described, without the several years delay required for certification of an untested system.
Universal one-way hash functions and their cryptographic applications
964 Citations1989Moni Naor, Moti Yung
A Universal One-Way Hash Function family is defined, a new primitive which enables the compression of elements in the function domain and it is proved constructively that universal one- way hash functions exist if any 1-1 one-way functions exist.
ComputerSpecial Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
557 Citations1977Whitfield Diffie, Martin E. Hellman
Communications of the ACMOn the security of multiple encryption
239 Citations1981Ralph C. Merkle, Martin E. Hellman
It is shown that although either technique significantly improves security over single encryption, the new technique does not significantly increase security over simple double encryption.
Proceedings of the IEEEData Encryption Standard: past and future
230 Citations1988Miles E. Smid, Dennis K. Branstad
The authors examine the past and future of the Data Encryption Standard (DES), which is the first, and to the present date, only, publicly available cryptographic algorithm that has been endorsed by the US government of the standard.
Lecture notes in computer scienceAnother Birthday Attack
51 Citations2007Don Coppersmith
It is shown that a meet-in-the-middle attack can successfully defraud the Davies-Price message authentication scheme.
Lecture notes in computer scienceA High Speed Manipulation Detection Code
26 Citations2007Robert R. Jueneman
A revised 128-bit MDC algorithm is presented which overcomes the so-called Triple Birthday Attck introduced by Coppersmith and makes use of the Intel 8087/80287 Numeric Data Processor coprocessor chip for the IBM PC/XT/AT and similar microcomputers.
Cryptography-a state of the art review
9 Citations2003Craig H. Meyer
The authors gives an overview of cryptographic methods using symmetric and asymmetric algorithms and demonstrates why future cryptographic applications should use a hybrid approach, i.e., combination of asymmetric and symmetric (public key) methods.