Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
- 1 April 1999
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 58 (2) , 336-375
- https://doi.org/10.1006/jcss.1998.1618
Abstract
No abstract availableKeywords
This publication has 49 references indexed in Scilit:
- Incremental Cryptography: The Case of Hashing and SigningPublished by Springer Nature ,2001
- New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge ProofsPublished by Springer Nature ,2001
- When Won′t Membership Queries Help?Journal of Computer and System Sciences, 1995
- Incremental cryptography and application to virus protectionPublished by Association for Computing Machinery (ACM) ,1995
- Checking the correctness of memoriesAlgorithmica, 1994
- Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offsJournal of Computer and System Sciences, 1992
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- How to Generate Factored Random NumbersSIAM Journal on Computing, 1988
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986