The discrete logarithm modulo a composite hides 0(n) Bits

Journal of Computer and System Sciences

Volumn 47, Issue 3, 1993, Pages 376-404

  Hastad J ^a   Schrift, A W ^b   Shamir, A ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344056457     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(93)90038-X     Document Type: Article

References (28)

1. RSA/Rabin bits are 1/2 + 1/poly(log N) secure
2. Discrete Logarithms and Factoring
3. How to generate random integers with known factorization
4. A simple secure pseudo-random number generator
5. How to generate cryptographically strong sequences of pseudorandom bits
6. On the existence of pseudorandom generators
7. A hard-core predicate for all one-way functions
8. Almost all primes can be quickly certified
9. Probabilistic Encryption
10. Pseudo-random generators under uniform assumptions
11. The difference between consecutive primes
12. Pseudo-random generation from one-way functions
13. Efficient cryptographic schemes provably as secure as subset sum
14. How to recycle random bits
15. Minimum resource zero-knowledge proofs
16. The discrete logarithm hides O(log n) bits
17. How discrete is the discrete log?
18. Digital Signature and Public Key Cryptosystems as Intractable as Factoring
19. A method for obtaining digital signatures and public key cryptosystems
20. The discrete log is very discreet
21. Efficient and secure pseudo-random number generator
22. Theory and applications of trapdoor functions