Discrete logarithm hides O(log n) bits

Douglas L. Long; Avi Wigderson

doi:10.1137/0217021

Discrete logarithm hides O(log n) bits

Douglas L. Long^*
, Avi Wigderson

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-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 g^x(mod p), even with a tiny advantage over guessing, is equivalent to computing discrete logarithms mod p.

Original language	English
Pages (from-to)	363-372
Number of pages	10
Journal	SIAM Journal on Computing
Volume	17
Issue number	2
DOIs	https://doi.org/10.1137/0217021
State	Published - 1988
Externally published	Yes

Access to Document

10.1137/0217021

Cite this

@article{b1306e4765004974b56d2f5ef4cc2b53,

title = "Discrete logarithm hides O(log n) bits",

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.",

author = "Long, \{Douglas L.\} and Avi Wigderson",

year = "1988",

doi = "10.1137/0217021",

language = "אנגלית",

volume = "17",

pages = "363--372",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - Discrete logarithm hides O(log n) bits

AU - Long, Douglas L.

AU - Wigderson, Avi

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0023985034

U2 - 10.1137/0217021

DO - 10.1137/0217021

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0023985034

SN - 0097-5397

VL - 17

SP - 363

EP - 372

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -

Discrete logarithm hides O(log n) bits

Abstract

Access to Document

Other files and links

Fingerprint

Cite this