International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Weak Fields for ECC

Authors:
Alfred Menezes
Edlyn Teske
Annegret Weng
Download:
URL: http://eprint.iacr.org/2003/128
Search ePrint
Search Google
Abstract: We demonstrate that some finite fields, including GF(2^210) are weak for elliptic curve cryptography in the sense that any instance of the elliptic curve discrete logarithm problem for any elliptic curve over these fields can be solved in significantly less time than it takes Pollard's rho method to solve the hardest instances. We discuss the implications of our observations to elliptic curve cryptography, and list some open problems.
BibTeX
@misc{eprint-2003-11843,
  title={Weak Fields for ECC},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography /},
  url={http://eprint.iacr.org/2003/128},
  note={ ajmeneze@uwaterloo.ca 12230 received 26 Jun 2003},
  author={Alfred Menezes and Edlyn Teske and Annegret Weng},
  year=2003
}