The Discrete Logarithm Hides $O(\log n)$ Bits

DOI10.1137/0217021zbMath0644.94017OpenAlexW2058330889MaRDI QIDQ3787919

Avi Wigderson, Douglas L. Long

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

public-key cryptographypseudorandom bit generatorone-way functionsdiscrete logarithmsbit securitysecure transactions

Mathematics Subject Classification ID

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

Related Items (6)

All Bits in ax + b mod p are Hard ⋮ Paillier's trapdoor function hides \(\Theta(n)\) bits ⋮ Mathematical problems in cryptology ⋮ Secure and efficient off-line digital money (extended abstract) ⋮ Gauss periods: orders and cryptographical applications ⋮ Quantum attacks on pseudorandom generators

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