CSIDH: an efficient post-quantum commutative group action
type: Item
instance of: scholarly article
title: CSIDH: an efficient post-quantum commutative group action
zbMATH Open document ID: 1407.81084
DOI: 10.1007/978-3-030-03332-3_15
author: Wouter Castryck
author: Tanja Lange
author: Chloe Martindale
author: Lorenz Panny
author: Joost Renes
publication date: 2019-01-23T00:00:00Z
full work available at URL: https://biblio.ugent.be/publication/8619033
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81P94
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 7005646
zbMATH Keywords: post-quantum cryptography
zbMATH Keywords: class-group action
zbMATH Keywords: isogeny-based cryptography
zbMATH Keywords: non-interactive key exchange
zbMATH Keywords: key confirmation
MaRDI profile type: Publication
OpenAlex ID: W2811492100
cites work: On the cost of computing isogenies between supersingular elliptic curves
cites work: TweetNaCl: A Crypto Library in 100 Tweets
cites work: A note on the security of CSIDH
cites work: A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
cites work: Computing endomorphism rings of elliptic curves under the GRH
cites work: Quantum security analysis of CSIDH
cites work: Q4279566
cites work: A $p$-adic algorithm to compute the Hilbert class polynomial
cites work: Efficient CM-constructions of elliptic curves over finite fields
cites work: Binary quadratic forms. An algorithmic approach
cites work: Cryptographic hash functions from expander graphs
cites work: Constructing elliptic curve isogenies in quantum subexponential time
cites work: Q3222942
cites work: A simple and compact algorithm for SIDH with arbitrary degree isogenies
cites work: Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
cites work: Q4920301
cites work: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
cites work: Towards practical key exchange from ordinary isogeny graphs
cites work: Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
cites work: New directions in cryptography
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Non-Interactive Key Exchange
cites work: Secure integration of asymmetric and symmetric encryption schemes
cites work: Constructing Isogenies between Elliptic Curves Over Finite Fields
cites work: Mathematics of public key cryptography.
cites work: On the Security of Supersingular Isogeny Cryptosystems
cites work: Identification protocols and signature schemes based on supersingular isogeny problems
cites work: Computational problems in supersingular elliptic curve isogenies
cites work: Q4228473
cites work: A Rigorous Subexponential Algorithm For Computation of Class Groups
cites work: Fast quantum algorithms for computing the unit group and class group of a number field
cites work: Zur Theorie der abstrakten elliptischen Funktionenkörper III. Die Struktur des Meromorphismenrings. Die Riemannsche Vermutung.
cites work: A modular analysis of the Fujisaki-Okamoto transformation
cites work: Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
cites work: A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
cites work: Expander graphs based on GRH with an application to elliptic curve cryptography
cites work: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
cites work: Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
cites work: Factoring polynomials with rational coefficients
cites work: Speeding the Pollard and Elliptic Curve Methods of Factorization
cites work: The Congruence (p - 1/2)! ≡± 1 (mod p)
cites work: The LLL algorithm. Survey and applications
cites work: Faster algorithms for isogeny problems using torsion point images
cites work: Ramanujan graphs and Hecke operators
cites work: Computing isogenies between Montgomery curves using the action of \((0,0)\)
cites work: Nonsingular plane cubic curves over finite fields
cites work: Q5628224
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: The Arithmetic of Elliptic Curves
cites work: Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
cites work: Identifying supersingular elliptic curves
cites work: Isogeny volcanoes
cites work: Endomorphisms of Abelian varieties over finite fields
cites work: Quantum Proofs of Knowledge
cites work: Q5631239
cites work: Abelian varieties over finite fields
cites work: A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies