Faster algorithms for isogeny computations over extensions of finite fields

DOI10.1007/978-3-031-82380-0_4MaRDI QIDQ6996941zbMATH OpenFDO

Authors Shiping Cai, Mingjie Chen, Christophe Petit

Publication date 15 April 2025

Full work available at URL https://doi.org/10.1007/978-3-031-82380-0_4

zbMATH Keywords

isogeny-based cryptographysupersingular elliptic curve

Mathematics Subject Classification ID

Elliptic curves over local fields (11G07) Elliptic curves (14H52) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• Abelian varieties over finite fields
• Fast and Frobenius: rational isogeny evaluation over finite fields
• Faster computation of isogenies of large prime degree
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3356934 (Why is no real title available?)
• Identification protocols and signature schemes based on supersingular isogeny problems
• Mathematics of public key cryptography.
• New algorithms for the Deuring correspondence. Towards practical and secure SQISign signatures
• Nonsingular plane cubic curves over finite fields
• Orienteering with one endomorphism
• Sato-Tate groups of 𝑦²=𝑥⁸+𝑐 and 𝑦²=𝑥⁷-𝑐𝑥.
• SQISign: compact post-quantum signatures from quaternions and isogenies

This page was built for publication: Faster algorithms for isogeny computations over extensions of finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996941)