Paper 2011/146

ECDLP on GPU

Lei Xu, Dongdai Lin, and Jing Zou

Abstract

Elliptic curve discrete logarithm problem (ECDLP) is one of the most important hard problems that modern cryptography, especially public key cryptography, relies on. And many efforts are dedicate to solve this problem. In recent days, GPU technology develops very fast and GPU has become a powerful tool for massive computation. In this paper, we give an implementation of parallel Pollard ρ method, for ECDLP on GPU, and eliminate nearly all the conditional branches in procedures for big integer, elliptic curve and iteration function. The experimental result shows that with the help of GPU, we can gain a speedup of more than one hundred times. The branchless procedures are also useful for preventing side channel attacks.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. Unknown where it was published
Keywords
discrete logarithm problemGPU
Contact author(s)
xuleimath @ gmail com
History
2011-03-27: received
Short URL
https://ia.cr/2011/146
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/146,
      author = {Lei Xu and Dongdai Lin and Jing Zou},
      title = {ECDLP on GPU},
      howpublished = {Cryptology ePrint Archive, Paper 2011/146},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/146}},
      url = {https://eprint.iacr.org/2011/146}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.