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 language | English |
---|---|
Pages (from-to) | 363-372 |
Number of pages | 10 |
Journal | SIAM Journal on Computing |
Volume | 17 |
Issue number | 2 |
DOIs | |
State | Published - 1988 |
Externally published | Yes |