Abstract
This paper considers the computational complexity of the discrete logarithm and related problems in the context of “generic algorithms”–that is, algorithms which do not exploit any special properties of the encodings of group elements, other than the property that each group element is encoded as a unique binary string. Lower bounds on the complexity of these problems are proved that match the known upper bounds: any generic algorithm must perform Ω(p1/2) group operations, where p is the largest prime dividing the order of the group. Also, a new method for correcting a faulty Diffie-Hellman oracle is presented.
Cite
CITATION STYLE
Shoup, V. (1997). Lower bounds for discrete logarithms and related problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1233, pp. 256–266). Springer Verlag. https://doi.org/10.1007/3-540-69053-0_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
