CSIDH: an efficient post-quantum commutative group action
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3889661 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 503244 (Why is no real title available?)
- scientific article; zbMATH DE number 6164023 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- A p-adic algorithm to compute the Hilbert class polynomial
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- A modular analysis of the Fujisaki-Okamoto transformation
- A note on the security of CSIDH
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
- A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
- Abelian varieties over finite fields
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Binary quadratic forms. An algorithmic approach
- Computational problems in supersingular elliptic curve isogenies
- Computing endomorphism rings of elliptic curves under the GRH
- Computing isogenies between Montgomery curves using the action of (0,0)
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Constructing elliptic curve isogenies in quantum subexponential time
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Cryptographic hash functions from expander graphs
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Efficient CM-constructions of elliptic curves over finite fields
- Endomorphisms of Abelian varieties over finite fields
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Factoring polynomials with rational coefficients
- Fast quantum algorithms for computing the unit group and class group of a number field
- Faster algorithms for isogeny problems using torsion point images
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Identification protocols and signature schemes based on supersingular isogeny problems
- Identifying supersingular elliptic curves
- Isogeny volcanoes
- Mathematics of public key cryptography.
- New directions in cryptography
- Non-interactive key exchange
- Nonsingular plane cubic curves over finite fields
- On the Security of Supersingular Isogeny Cryptosystems
- On the cost of computing isogenies between supersingular elliptic curves
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum proofs of knowledge
- Quantum security analysis of CSIDH
- Ramanujan graphs and Hecke operators
- Secure integration of asymmetric and symmetric encryption schemes
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Arithmetic of Elliptic Curves
- The Congruence (p - 1/2)! ≡± 1 (mod p)
- The LLL algorithm. Survey and applications
- Towards practical key exchange from ordinary isogeny graphs
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- TweetNaCl: A Crypto Library in 100 Tweets
- Zur Theorie der abstrakten elliptischen Funktionenkörper III. Die Struktur des Meromorphismenrings. Die Riemannsche Vermutung.
Cited in
(only showing first 100 items - show all)- Effective pairings in isogeny-based cryptography
- Breaking SIDH in polynomial time
- Orienteering with one endomorphism
- SoK: how (not) to design and implement post-quantum cryptography
- Horizontal racewalking using radical isogenies
- Multiple group action dlogs with(out) precomputation
- Faster SCALLOP from non-prime conductor suborders in medium sized quadratic fields
- Radical 2-isogenies and cryptographic hash functions in dimensions 1, 2 and 3
- A framework for group action-based multi-signatures and applications to LESS, MEDS, and ALTEQ
- The supersingular isogeny problem in genus 2 and beyond
- On the security of OSIDH
- Special properties of the point addition law for non-cyclic Edwards curves
- Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies
- Enhanced bound for the commutative isogeny hidden number problem in CSURF
- CSIDH on the surface
- A fusion algorithm for solving the hidden shift problem in finite abelian groups
- Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications
- An efficient authenticated key exchange from random self-reducibility on CSIDH
- Improved supersingularity testing of elliptic curves using Legendre form
- Practical isogeny-based key-exchange with optimal tightness
- Towards post-quantum security for signal's X3DH handshake
- Trapdoor DDH groups from pairings and isogenies
- Improved torsion-point attacks on SIDH variants
- Orientations and the supersingular endomorphism ring problem
- L₁-norm ball for CSIDH: optimal strategy for choosing the secret key space
- A guide to the design of digital signatures based on cryptographic group actions
- Counting Richelot isogenies between superspecial abelian surfaces
- On oriented supersingular elliptic curves
- On collisions related to an ideal class of order 3 in CSIDH
- Cryptographic primitives with hinting property
- From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
- Improvement of the square-root Vélu's formulas for isogeny-based cryptography
- Generalized class group actions on oriented elliptic curves with level structure
- An efficient strong asymmetric PAKE compiler instantiable from group actions
- Neighborhood of vertices in the isogeny graph of principally polarized superspecial abelian surfaces
- Hidden stabilizers, the isogeny to endomorphism ring problem and the cryptanalysis of pSIDH
- Efficient compression of SIDH public keys
- Efficient theta-based algorithms for computing ( , )-isogenies on Kummer surfaces for arbitrary odd
- Enhancing threshold group action signature schemes: adaptive security and scalability improvements
- Rational isogenies from irrational endomorphisms
- Efficient implementations of square-root Vélu's formulas
- Modular multiplication in the AMNS representation: hardware implementation
- SILBE: an updatable public key encryption scheme from lollipop attacks
- Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
- Take your MEDS: digital signatures from matrix code equivalence
- Weak instances of class group action based cryptography via self-pairings
- Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol
- Post-quantum anonymous one-sided authenticated key exchange without random oracles
- How not to create an isogeny-based PAKE
- \textsf{CSI-RAShi}: distributed key generation for CSIDH
- SimS: a simplification of SiGamal
- Optimally-fair exchange of secrets via delay encryption and commutative blinding
- Exponential speedup of quantum algorithms for the pathfinding problem
- Faster isogenies for post-quantum cryptography: SIKE
- On random sampling of supersingular elliptic curves
- Towards practical key exchange from ordinary isogeny graphs
- Higher-degree supersingular group actions
- Post-quantum asynchronous deniable key exchange and the signal handshake
- Cryptographic group and semigroup actions
- A review of mathematical and computational aspects of CSIDH algorithms
- Pseudo-random walk on ideals: practical speed-up in relation collection for class group computation
- On the efficient representation of isogenies. A survey for NuTMiC 2024
- Multiradical isogenies
- On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves
- DeCSIDH: delegating isogeny computations in the CSIDH setting
- Hash functions from superspecial genus-2 curves using Richelot isogenies
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
- (Short paper) Analysis of a strong fault attack on static/ephemeral CSIDH
- On the multi-user security of LWE-based NIKE
- Round-robin is optimal: lower bounds for group action based protocols
- Robustly reusable fuzzy extractor from isogeny
- SHealS and HealS: Isogeny-Based PKEs from a Key Validation Method for SIDH
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
- He gives C-sieves on the CSIDH
- Quantum security analysis of CSIDH
- Supersingular curves with small noninteger endomorphisms
- Attack on SHealS and HealS: the second wave of GPST
- Post-quantum signal key agreement from SIDH
- Quantum lattice enumeration and tweaking discrete pruning
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Radical isogenies
- SiGamal: a supersingular isogeny-based PKE and its application to a PRF
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Post-quantum secure compact deterministic wallets from isogeny-based signatures with rerandomized keys
- \textsf{FESTA}: fast encryption from supersingular torsion attacks
- Identity-based threshold signatures from isogenies
- Non-interactive commitment from non-transitive group actions
- VSS from distributed ZK proofs and applications
- Orienting supersingular isogeny graphs
- Explicit connections between supersingular isogeny graphs and Bruhat-Tits trees
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- Group action key encapsulation and non-interactive key exchange in the QROM
- Radical isogenies and modular curves
- Post-Quantum Constant-Round Group Key Exchange from Static Assumptions
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- New techniques for SIDH-based NIKE
- Protecting the most significant bits in scalar multiplication algorithms
- Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
This page was built for publication: CSIDH: an efficient post-quantum commutative group action
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1710683)
