Simultaneous Security of Bits in the Discrete Log

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 219 LNCS, Issue , 1986, Pages 62-72

  Peralta, René ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NUMBER THEORY;

MODULAR EXPONENTIATION; PSEUDO RANDOM NUMBER GENERATORS;

RANDOM NUMBER GENERATION;

EID: 0039783282     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39805-8_8     Document Type: Conference Paper

References (9)

1. Blum, L, Blum, M. Blum, and M. Shub, “A Simple Secure Pseudo-Random Number Generator,” CRYPTO 82, 1982.
2. Blum, M. Blum and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo Random Bits,” 23rd. FOCS, pp. 112–117, 1982.
3. Coppersmith Coppersmith, “Unpublished Result,” Private Communication through C.P. Schnorr.
4. Long, D. Long and A. Widgerson, “How Discreet is the Discrete Log,” 15th. STOC, 1983.
5. Long. D. Long, “The Security of Bits in the Discrete Logarithm,” PhD Dissertation, Princeton University, January, 1984.
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.
7. Rabin, M. Rabin, “Probabilistic Algorithms in Finite Fields,” Siam J. Comp., vol. 9, pp. 273–280, 1980.
8. Vazirani, U. Vazirani and V. Vazirani, “Efficient and Secure Pseudo Random Number Generation,” Proceedings of the 25th. FOCS, 1984.
9. Yao, A. Yao, “Theory and Applications of Trapdoor Functions,” 1982 FOCS, 1982.