TY - JOUR

T1 - Computing a sequence of 2-isogenies on supersingular elliptic curves

AU - Yoshida, Reo

AU - Takashima, Katsuyuki

PY - 2013/1

Y1 - 2013/1

N2 - 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.

AB - 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.

KW - Isogeny

KW - Post-quantum cryptography

KW - Supersingular elliptic curves

UR - http://www.scopus.com/inward/record.url?scp=84871884503&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871884503&partnerID=8YFLogxK

U2 - 10.1587/transfun.E96.A.158

DO - 10.1587/transfun.E96.A.158

M3 - Article

AN - SCOPUS:84871884503

VL - E96-A

SP - 158

EP - 165

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 1

ER -