Simultaneous Security of Bits in the Discrete Log

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 219)


We show that c log log P simultaneously secure bits can be extracted from the discrete log function. These bits satisfy the next-bit unpredictability condition of Blum and Micali. Therefore we can construct a cryptographically secure pseudo random number generator which produces c log log P bits per modular exponentiation under the assumption that the discrete log is hard.


Polynomial Time Pseudo Random Number Quadratic Residue Modular Exponentiation Quadratic Character 
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.


  1. Blum,. L. Blum, M. Blum, and M. Shub, “A Simple Secure Pseudo-Random Number Generator,” CRYPTO 82, 1982.Google Scholar
  2. Blum,. M. Blum and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo Random Bits,” 23rd. FOCS, pp. 112–117, 1982.Google Scholar
  3. Coppersmith,. Coppersmith, “Unpublished Result,” Private Communication through C.P. Schnorr.Google Scholar
  4. Long,. D. Long and A. Widgerson, “How Discreet is the Discrete Log,” 15th. STOC, 1983.Google Scholar
  5. Long,. D. Long, “The Security of Bits in the Discrete Logarithm,” PhD Dissertation, Princeton University, January, 1984.Google Scholar
  6. Pohlig,. S. Pohlig and M. Hellman, “An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance.,” IEEE Transactions on Information Theory, vol. 1, no. 1, January 1978.Google Scholar
  7. Rabin,. M. Rabin, “Probabilistic Algorithms in Finite Fields,” Siam J. Comp., vol. 9, pp. 273–280, 1980.zbMATHCrossRefMathSciNetGoogle Scholar
  8. Vazirani,. U. Vazirani and V. Vazirani, “Efficient and Secure Pseudo Random Number Generation,” Proceedings of the 25th. FOCS, 1984.Google Scholar
  9. Yao,. A. Yao, “Theory and Applications of Trapdoor Functions,” 1982 FOCS, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeley

Personalised recommendations