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.
|ジャーナル||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|出版ステータス||Published - 2009|
|イベント||11th International Conference on Information Security and Cryptology, ICISC 2008 - Seoul, Korea, Republic of|
継続期間: 2008 12月 3 → 2008 12月 5
ASJC Scopus subject areas
- コンピュータ サイエンス（全般）