Simple algorithms for computing a sequence of 2-isogenies

Reo Yoshida*, Katsuyuki Takashima

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

3 Citations (Scopus)


Recently, some cryptographic primitives have been described that are based on the supposed hardness of finding an isogeny between two (supersingular) elliptic curves. As a part of such a primitive, Charles et al. proposed an algorithm for computing sequences of 2-isogenies. However, their method involves several redundant computations. We construct simple algorithms without such redundancy, based on very compact descriptions of the 2-isogenies. For that, we use some observations on 2-torsion points.

Original languageEnglish
Pages (from-to)52-65
Number of pages14
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publication statusPublished - 2009
Externally publishedYes
Event11th International Conference on Information Security and Cryptology, ICISC 2008 - Seoul, Korea, Republic of
Duration: 2008 Dec 32008 Dec 5

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Simple algorithms for computing a sequence of 2-isogenies'. Together they form a unique fingerprint.

Cite this