Computing a sequence of 2-isogenies on supersingular elliptic curves

Reo Yoshida*, Katsuyuki Takashima

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 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)158-165
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number1
Publication statusPublished - 2013 Jan
Externally publishedYes


  • Isogeny
  • Post-quantum cryptography
  • Supersingular elliptic curves

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Computing a sequence of 2-isogenies on supersingular elliptic curves'. Together they form a unique fingerprint.

Cite this