Supersingular curves you can trust
From MaRDI portal
Publication:6061368
DOI10.1007/978-3-031-30617-4_14MaRDI QIDQ6061368
Andrea Basso, Sikhar Patranabis, Travis Morrison, Giulio Codogni, Deirdre Connolly, Guido Lido, Tako Boris Fouotsa, Luca De Feo, Lorenz Panny, Benjamin Wesolowski
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves over local fields (11G07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Cryptographic hash functions from expander graphs
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- Faster algorithms for isogeny problems using torsion point images
- Towards practical key exchange from ordinary isogeny graphs
- CSIDH: an efficient post-quantum commutative group action
- La conjecture de Weil. I
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Delay encryption
- Rational isogenies from irrational endomorphisms
- Improved torsion-point attacks on SIDH variants
- Orientations and the supersingular endomorphism ring problem
- CSI-FiSh: efficient isogeny based signatures through class group computations
- Verifiable delay functions from supersingular isogenies and pairings
- \(p\)-adic dynamics of Hecke operators on modular curves
- Aurora: transparent succinct arguments for R1CS
- SeaSign: compact isogeny signatures from class group actions
- Faster SeaSign signatures through improved rejection sampling
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Cryptographic group actions and applications
- Oblivious pseudorandom functions from isogenies
- On the Security of Supersingular Isogeny Cryptosystems
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The basis problem for modular forms on Γ₀(𝑁)
- Ramanujan graphs and Hecke operators
- CSIDH on the Surface
- On the Isogeny Problem with Torsion Point Information
- Quaternion Algebras
- Efficient Compression of SIDH Public Keys
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Supersingular curves with small noninteger endomorphisms
- Faster computation of isogenies of large prime degree
- Identification protocols and signature schemes based on supersingular isogeny problems
- Identification protocols and signature schemes based on supersingular isogeny problems
- Séta: Supersingular Encryption from Torsion Attacks
- SIDH proof of knowledge
