Constructing Cycles in Isogeny Graphs of Supersingular Elliptic Curves
Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve E defined over 𝔽p2, if an imaginary quadratic order O can be embedded in End(E) and a prime L splits into two principal ideals in O,...
| Autores principales: | , , |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
De Gruyter
2021-05-01
|
| Colección: | Journal of Mathematical Cryptology |
| Materias: | |
| Acceso en línea: | https://doi.org/10.1515/jmc-2020-0029 |
| Sumario: | Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve E defined over 𝔽p2, if an imaginary quadratic order O can be embedded in End(E) and a prime L splits into two principal ideals in O, we construct loops or cycles in the supersingular L-isogeny graph at the vertices which are next to j(E) in the supersingular ℓ-isogeny graph where ℓ is a prime different from L. Next, we discuss the lengths of these cycles especially for j(E) = 1728 and 0. Finally, we also determine an upper bound on primes p for which there are unexpected 2-cycles if ℓ doesn’t split in O. |
|---|---|
| ISSN: | 1862-2976 1862-2984 |