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

David Jao, Stephen D. Miller, Ramarathnam Venkatesan. Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?. In Bimal K. Roy, editor, 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. Volume 3788 of Lecture Notes in Computer Science, pages 21-40, Springer, 2005. [doi]

Abstract

Abstract is missing.

  翻译: