Square-Root Algorithms For The Discrete Logarithm Problem (a Survey) (2001)
| Venue: | In Public Key Cryptography and Computational Number Theory, Walter de Gruyter |
| Citations: | 23 - 0 self |
BibTeX
@INPROCEEDINGS{Teske01square-rootalgorithms,
author = {Edlyn Teske},
title = {Square-Root Algorithms For The Discrete Logarithm Problem (a Survey)},
booktitle = {In Public Key Cryptography and Computational Number Theory, Walter de Gruyter},
year = {2001},
pages = {283--301}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The best algorithms to compute discrete logarithms in arbitrary groups (of prime order) are the baby-step giant-step method, the rho method and the kangaroo method. The first two have (expected) running time O( p n) group operations (n denoting the group order), thereby matching Shoup's lower bounds. While the baby-step giant-step method is deterministic but with large memory requirements, the rho and the kangaroo method are probabilistic but can be implemented very space efficiently, and they can be parallelized with linear speed-up. In this paper, we present the state of the art in these methods.
