Paper 2009/466
The Certicom Challenges ECC2-X
Daniel V. Bailey, Brian Baldwin, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Gauthier van Damme, Giacomo de Meulenaer, Junfeng Fan, Tim Güneysu, Frank Gurkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Christof Paar, Francesco Regazzoni, Peter Schwabe, and Leif Uhsadel
Abstract
To encourage research on the hardness of the elliptic-curve
discrete-logarithm problem (ECDLP) Certicom has published a series
of challenge curves and DLPs.
This paper analyzes the costs of breaking the Certicom challenges
over the binary fields
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- ECCbinary fieldsCerticom challenges
- Contact author(s)
- tanja @ hyperelliptic org
- History
- 2009-09-26: received
- Short URL
- https://ia.cr/2009/466
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/466, author = {Daniel V. Bailey and Brian Baldwin and Lejla Batina and Daniel J. Bernstein and Peter Birkner and Joppe W. Bos and Gauthier van Damme and Giacomo de Meulenaer and Junfeng Fan and Tim Güneysu and Frank Gurkaynak and Thorsten Kleinjung and Tanja Lange and Nele Mentens and Christof Paar and Francesco Regazzoni and Peter Schwabe and Leif Uhsadel}, title = {The Certicom Challenges {ECC2}-X}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/466}, year = {2009}, url = {https://eprint.iacr.org/2009/466} }