Fast and Frobenius: rational isogeny evaluation over finite fields

DOI10.1007/978-3-031-44469-2_7MaRDI QIDQ6619928zbMATH OpenFDO

Authors Gustavo Banegas, Valerie Gilchrist, Anaëlle Le Dévéhat, Benjamin Smith

Publication date 16 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-44469-2_7

zbMATH Keywords

elliptic curves over a finite fieldVélu's formulæ

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Finite fields (field-theoretic aspects) (12E20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Isogeny (14K02) Cryptography (94A60)

Recommendations

• Faster computation of isogenies of large prime degree
• A subexponential algorithm for evaluating large degree isogenies
• Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
• Optimizing the evaluation of \(\ell\)-isogenous curve for isogeny-based cryptography
• Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic

Cites work

• A simple and compact algorithm for SIDH with arbitrary degree isogenies
• Advances in cryptology -- ASIACRYPT 2018. 24th international conference on the theory and application of cryptology and information security, Brisbane, QLD, Australia, December 2--6, 2018. Proceedings. Part III
• Computing isogenies between Montgomery curves using the action of (0,0)
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• CSI-FiSh: efficient isogeny based signatures through class group computations
• CSIDH: an efficient post-quantum commutative group action
• Faster computation of isogenies of large prime degree
• scientific article; zbMATH DE number 3356934 (Why is no real title available?)
• Low memory attacks on small key CSIDH
• New algorithms for the Deuring correspondence. Towards practical and secure SQISign signatures
• On lions and elligators: an efficient constant-time implementation of CSIDH
• Optimal strategies for CSIDH
• Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies
• Pseudoprimes and a generalization of Artin's conjecture
• Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
• Rational isogenies from irrational endomorphisms
• Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol
• SCALLOP: scaling the CSI-FiSh
• SeaSign: compact isogeny signatures from class group actions
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• SQISign: compact post-quantum signatures from quaternions and isogenies
• The Arithmetic of Elliptic Curves
• Towards practical key exchange from ordinary isogeny graphs

Cited in

(5)

• Improvement of the square-root Vélu's formulas for isogeny-based cryptography
• AprèsSQI: extra fast verification for SQIsign using extension-field signing
• Efficient implementations of square-root Vélu's formulas
• Faster algorithms for isogeny computations over extensions of finite fields
• On the efficient representation of isogenies. A survey for NuTMiC 2024

This page was built for publication: Fast and Frobenius: rational isogeny evaluation over finite fields

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