Hash Functions: From Merkle-Damgård to Shoup
- 15 April 2001
- book chapter
- Published by Springer Nature
- p. 166-181
- https://doi.org/10.1007/3-540-44987-6_11
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Lower bounds on the efficiency of generic cryptographic constructionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Design Principle for Hash FunctionsPublished by Springer Nature ,2001
- Hash Functions Based on Block CiphersPublished by Springer Nature ,2001
- A Composition Theorem for Universal One-Way Hash FunctionsPublished by Springer Nature ,2000
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?Published by Springer Nature ,1998
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991
- One-way functions are necessary and sufficient for secure signaturesPublished by Association for Computing Machinery (ACM) ,1990
- One Way Hash Functions and DESPublished by Springer Nature ,1990
- Universal one-way hash functions and their cryptographic applicationsPublished by Association for Computing Machinery (ACM) ,1989