Efficient, perfect polynomial random number generators
- 1 January 1991
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 3 (3) , 157-172
- https://doi.org/10.1007/bf00196909
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Generating Quasi-Random Sequences From Slightly-Random SourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The number field sievePublished by Association for Computing Machinery (ACM) ,1990
- Statistical independence of nonlinear congruential pseudorandom numbersMonatshefte für Mathematik, 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- How to construct random functionsJournal of the ACM, 1986
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- How to generate cryptographically strong sequences of pseudo random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977