International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?

Authors:
David Jao
Stephen D. Miller
Ramarathnam Venkatesan
Download:
DOI: 10.1007/11593447_2
URL: https://iacr.org/archive/asiacrypt2005/021/021.pdf
Search ePrint
Search Google
Conference: ASIACRYPT 2005
BibTeX
@inproceedings{asiacrypt-2005-217,
  title={Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?},
  booktitle={Advances in Cryptology - ASIACRYPT 2005, 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={3788},
  pages={21-40},
  url={https://iacr.org/archive/asiacrypt2005/021/021.pdf},
  doi={10.1007/11593447_2},
  author={David Jao and Stephen D. Miller and Ramarathnam Venkatesan},
  year=2005
}