Simple algorithms for computing a sequence of 2-isogenies

Reo Yoshida*, Katsuyuki Takashima

*この研究の対応する著者

研究成果: Conference article査読

3 被引用数 (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.

本文言語English
ページ(範囲)52-65
ページ数14
ジャーナルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5461
DOI
出版ステータスPublished - 2009
外部発表はい
イベント11th International Conference on Information Security and Cryptology, ICISC 2008 - Seoul, Korea, Republic of
継続期間: 2008 12 32008 12 5

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Simple algorithms for computing a sequence of 2-isogenies」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル