A Simple Unpredictable Pseudo-Random Number Generator
- 1 May 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (2), 364-383
- https://doi.org/10.1137/0215025
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Inferring a sequence generated by a linear congruencePublished 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
- On the generation of cryptographically strong pseudo-random sequencesLecture Notes in Computer Science, 1981
- Mental PokerPublished by Springer Nature ,1981
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- New directions in cryptographyIEEE Transactions on Information Theory, 1976