On the Cryptographic Applications of Random Functions (Extended Abstract)
- 24 November 2000
- book chapter
- Published by Springer Nature
- p. 276-288
- https://doi.org/10.1007/3-540-39568-7_22
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- On Computationally Secure Authentication Tags Requiring Short Secret Shared KeysPublished by Springer Nature ,1983
- Comparison of Two Pseudo-Random Number GeneratorsPublished by Springer Nature ,1983
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Why and how to establish a private code on a public networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Universal classes of hash functions (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1977