Computing a sequence of 2-isogenies on supersingular elliptic curves

Reo Yoshida, Katsuyuki Takashima

研究成果: Article査読

1 被引用数 (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
ページ(範囲)158-165
ページ数8
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E96-A
1
DOI
出版ステータスPublished - 2013 1
外部発表はい

ASJC Scopus subject areas

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

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

引用スタイル