The Discrete Logarithm Hides O(\log n) Bits

DOI10.1137/0217021MaRDI QIDQ3787919zbMATH OpenOpenAlexFDO

Authors Douglas L. Long, A. Wigderson

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/dc1b2c29b316d82f1da34ffacbb73575b8178150

zbMATH Keywords

bit securitydiscrete logarithmsone-way functionspseudorandom bit generatorpublic-key cryptographysecure transactions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Simultaneous Security of Bits in the Discrete Log
• The security of all RSA and discrete log bits
• The discrete logarithm modulo a composite hides \(O(n)\) bits
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Topics in Cryptology – CT-RSA 2005

Cited in

(11)

• The discrete logarithm modulo a composite hides \(O(n)\) bits
• Mathematical problems in cryptology
• All bits in ax + b p are hard
• Paillier's trapdoor function hides \(\Theta(n)\) bits
• Simultaneous Security of Bits in the Discrete Log
• Gauss periods: orders and cryptographical applications
• Secure and efficient off-line digital money (extended abstract)
• Quantum attacks on pseudorandom generators
• Topics in Cryptology – CT-RSA 2005
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• Robust additive randomized encodings from IO and pseudo-non-linear codes

This page was built for publication: The Discrete Logarithm Hides $O(\log n)$ Bits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787919)