Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves

DOI10.3934/amc.2010.4.215zbMath1213.94136MaRDI QIDQ540365

Anton Stolbunov

Publication date: 3 June 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2010.4.215

zbMATH Keywords

finite field; isogeny; elliptic curve; group action; public-key cryptography; ideal class group

Mathematics Subject Classification ID

94A60: Cryptography

14G50: Applications to coding theory and cryptography of arithmetic geometry

Related Items

Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography, Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\), Improved algorithm for the isogeny problem for ordinary elliptic curves, Quantum lattice enumeration and tweaking discrete pruning, On the hardness of the computational ring-LWR problem and its applications, Towards practical key exchange from ordinary isogeny graphs, CSIDH: an efficient post-quantum commutative group action, Quantum algorithm design: techniques and applications, Efficient post-quantum undeniable signature on 64-bit ARM, Computational problems in supersingular elliptic curve isogenies, Algebraic generalization of Diffie-Hellman key exchange, Analogues of Vélu’s formulas for isogenies on alternate models of elliptic curves, Efficient Algorithms for Supersingular Isogeny Diffie-Hellman, Explicit isogenies in quadratic time in any characteristic, Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies