On the Design of Provably-Secure Cryptographic Hash Functions
Authors:
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 412-431
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Pseudo-random generation from one-way functions1989
- One-way functions are essential for complexity based cryptography1989
- Efficient cryptographic schemes provably as secure as subset sum1989
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- How to sign given any trapdoor function1988
- On the existence of pseudorandom generators1988
- Strong signature schemes1983
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975