Synthesizers and their application to the parallel construction of pseudo-random functions
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 170-181
- https://doi.org/10.1109/sfcs.1995.492474
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- An Efficient Software Protection SchemePublished by Springer Nature ,2001
- Two Remarks Concerning the Goldwasser-Micali-Rivest Signature SchemePublished by Springer Nature ,2000
- On the Cryptographic Applications of Random Functions (Extended Abstract)Published by Springer Nature ,2000
- Natural proofsPublished by Association for Computing Machinery (ACM) ,1994
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Efficient cryptographic schemes provably as secure as subset sumPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- How to construct random functionsJournal of the ACM, 1986
- On the generation of cryptographically strong pseudorandom sequencesACM Transactions on Computer Systems, 1983
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978