Isogeny formulae on extended Jacobi Quartic curves

Read full text Summarise with VIRAT
Authors: Ankit Chaudhary, Manoj Kumar, Kamal Upreti, R. K. Mishra, Akash Rathor, Shivender Goswami
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

In recent years, cryptographic research has seen a surge of interest in post-quantum cryptography driven by the potential threat that quantum computers pose to traditional public-key cryptosystems. Isogeny-based cryptography is a promising method in post-quantum cryptography, relying on the computational challenge of calculating isogenies, which are specific mappings between elliptic curves. The efficiency of isogeny computations is vital for real-world cryptographic applications. However, these computations, particularly with large parameters, can be highly resource intensive. In this work, we derive odd degree isogeny formulae for Extended Jacobi Quartic Curves based on u− coordinate, a novel approach to facilitate isogeny computations. These formulae are derived by analyzing the algebraic structure of the Extended Jacobi Quartic Curves, leveraging properties of the u− coordinate to express an isogeny map in terms of simpler, computationally efficient operations. We also explore the algebraic complexity of these computations and compute their runtimes for isogeny computations across different prime numbers and compare them with different models of an elliptic curve to check the performance.

Fields of Study & Subjects

Cryptography and Residue Arithmetic Cryptography and Data Security Algebraic Geometry and Number Theory

Publication details

Journal / source
Figshare
Publication date
18 March 2026
Language
EN