Comparison of Two Pseudo-Random Number Generators

  • Lenore Blum
  • Manuel Blum
  • Michael Shub


What do we want from a pseudo-random sequence generator? Ideally, we would like a pseudo-random sequence generator to quickly produce, from short seeds, long sequences (of bits) that appear in every way to be generated by successive flips of a fair coin.


Discrete Logarithm Problem Quadratic Residue Fair Coin Prescribe Form Jacobi Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    L. Adleman, “On Distinguishing Prime Numbers from Composite Numbers,” Proc. 21st IEEE Symp. on Found. of Comp. Science (1980), 387–408.Google Scholar
  2. [2]
    M. Blum, “Coin Flipping by Telephone,” in Proc. of IEEE Spring COMPCON (1982), 133–137.Google Scholar
  3. [3]
    M. Blum and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo Random Bits,” submitted to FOCS 1982.Google Scholar
  4. [4]
    G. Brassard, “On computationally Secure Authentication Tags Requiring Short Secret Shared Keys,” in Conf. Proc. Crypto 82, 1982.Google Scholar
  5. [5]
    L. Dickson, “History of the Theory of Numbers,” Chelsea Pub. Co., 1919 (republished 1971 ).Google Scholar
  6. [6]
    S. Even, “Graph Algorithms,” Computer Science Press, 1979.Google Scholar
  7. [7]
    C. G. Gauss, “Disquisitiones Arithmeticae,” 1801; reprinted in English transi. by Yale Univ. Press, 1966.Google Scholar
  8. [8]
    S. Goldwasser and S. Micali, “Probabilistic Encryption and How to Play Mental Poker Keeping Secret all Partial Information, ” 14th STOC (1982), 365–377.Google Scholar
  9. [9]
    S. Golomb, “Shift Register Sequences,” Aegean Park Press (1982).Google Scholar
  10. [10]
    D. Knuth, “The Art of Computer Programming: Seminumerical Algorithms,” Vol. 2, Addison-Wesley Pub. Co., 1981.Google Scholar
  11. [11]
    W. LeVeque, ‘Fundamentals of Number Theory,“ Addison-Wesley Pub. Co., 1977.Google Scholar
  12. [12]
    G. Miller, “Riemann’s Hypothesis and Tests for Primality,” Ph.D. Thesis, U.C. Berkeley (1975).Google Scholar
  13. [13]
    J. Plumstead, “Inferring a Sequence Generated by a Linear Congruence,” submitted to FOCS 1982.Google Scholar
  14. [14]
    S. Pohlig and M. Hellman, “An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance,” IEEE Trans. on Info. Theory, Vol. It-24, No. 1, (1978), 106–110.CrossRefGoogle Scholar
  15. [15]
    M. O. Rabin, “Probabilistic Algorithm for Tesitng Primality,” J. No. Theory, Vol 12 (1980), 128–138.CrossRefGoogle Scholar
  16. [16]
    M. O. Rabin, “Digital Signatures and Public-key Functions as Intractable as Factorization,” MIT/LCS/TR-212 Tech. memo, MIT, 1979.Google Scholar
  17. [17]
    A. Shamir, “On the Generation of Cryptographically Strong Pseudo-Random Sequences,” ICALP, 1981.Google Scholar
  18. [18]
    D. Shanks, “Solved and Unsolved Problems in Number Theory,” Chelsea Pub. Co., 1976.Google Scholar
  19. [19]
    J. von Neumann, “Various Techniques Used in Connection With Random Digits,” Collected Works, vol. 5, Macmillan (1963), 768–770.Google Scholar
  20. [20]
    A. Yao, “Theory and Applications of Trapdoor Functions,” submitted to FOCS 1982.Google Scholar

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • Lenore Blum
    • 1
    • 2
  • Manuel Blum
    • 3
  • Michael Shub
    • 4
    • 5
  1. 1.Dept. of Mathematics and Computer ScienceMills CollegeOaklandUSA
  2. 2.Dept. of MathematicsU.C. BerkeleyUSA
  3. 3.Dept. of Electrical Engineering and Computer SciencesUniversity of CaliforniaBerkeleyUSA
  4. 4.Dept. of MathematicsQueens CollegeFlushingUSA
  5. 5.Graduate Center of CUNYUSA

Personalised recommendations