Discrete logarithm hides O(log n) bits

Douglas L. Long*, Avi Wigderson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

34 Scopus citations

Abstract

The main result of this paper is that obtaining any information about the O(log|p|) 'most significant' bits of x, given gx(mod p), even with a tiny advantage over guessing, is equivalent to computing discrete logarithms mod p.

Original languageEnglish
Pages (from-to)363-372
Number of pages10
JournalSIAM Journal on Computing
Volume17
Issue number2
DOIs
StatePublished - 1988
Externally publishedYes

Fingerprint

Dive into the research topics of 'Discrete logarithm hides O(log n) bits'. Together they form a unique fingerprint.

Cite this