Computational problems in supersingular elliptic curve isogenies

DOI10.1007/s11128-018-2023-6zbMath1400.81083OpenAlexW2889320120MaRDI QIDQ1994699

Frederik Vercauteren, Steven D. Galbraith

Publication date: 1 November 2018

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/628094

zbMATH Keywords

post-quantum cryptographyelliptic curve isogeny

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (14)

The elliptic scalar multiplication graph and its application in elliptic curve cryptography ⋮ An efficient authenticated key exchange from random self-reducibility on CSIDH ⋮ On the hardness of the computational ring-LWR problem and its applications ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ The security of all private-key bits in isogeny-based schemes ⋮ An efficient key recovery attack on SIDH ⋮ A subexponential-time, polynomial quantum space algorithm for inverting the CM group action ⋮ SIDH proof of knowledge ⋮ Oblivious pseudorandom functions from isogenies ⋮ CSIDH: an efficient post-quantum commutative group action ⋮ Orienting supersingular isogeny graphs ⋮ Algebraic approaches for solving isogeny problems of prime power degrees ⋮ Delay encryption ⋮ Eliptic curves in post-quantum cryptography

Uses Software

• SIDH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved algorithm for the isogeny problem for ordinary elliptic curves
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• A low-memory algorithm for finding short product representations in finite groups.
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Cryptographic hash functions from expander graphs
• Claw finding algorithms using quantum walk
• Supersingular isogeny graphs and endomorphism rings: reductions and solutions
• Quantum resource estimates for computing elliptic curve discrete logarithms
• Faster algorithms for isogeny problems using torsion point images
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• On the quaternion -isogeny path problem
• Mathematics of Public Key Cryptography
• Isogeny-Based Quantum-Resistant Undeniable Signatures
• A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
• Isogeny volcanoes
• On the Security of Supersingular Isogeny Cryptosystems
• Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation
• On Fast Calculation of Addition Chains for Isogeny-Based Cryptography
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Post-Quantum Cryptography
• Constructing Isogenies between Elliptic Curves Over Finite Fields
• Ramanujan graphs and Hecke operators
• Constructing elliptic curve isogenies in quantum subexponential time
• Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Computing and Combinatorics
• Efficient Compression of SIDH Public Keys
• Identification protocols and signature schemes based on supersingular isogeny problems
• Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)

This page was built for publication: Computational problems in supersingular elliptic curve isogenies