The discrete logarithm modulo a composite hides \(O(n)\) bits
From MaRDI portal
Publication:1317484
DOI10.1016/0022-0000(93)90038-XzbMath0790.94013WikidataQ56959146 ScholiaQ56959146MaRDI QIDQ1317484
Johan T. Håstad, A. W. Schrift, A. Sharmir
Publication date: 30 June 1994
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
probability distributions; one-way function; Blum integer; efficient pseudorandom bit generators; multibit commitment schemes
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Efficient cryptographic schemes provably as secure as subset sum
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Efficient Factoring Based on Partial Information
- A Simple Unpredictable Pseudo-Random Number Generator
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- A method for obtaining digital signatures and public-key cryptosystems
- The Differences between Consecutive Primes