Trapdoor DDH groups from pairings and isogenies
From MaRDI portal
Publication:832364
DOI10.1007/978-3-030-81652-0_17zbMath1485.94102OpenAlexW3186255417MaRDI QIDQ832364
Javier Silva, Christophe Petit, Péter Kutas
Publication date: 25 March 2022
Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/106323464/Trapdoor_DDH_groups_from_pairings_and_isogenies.pdf
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves over local fields (11G07)
Uses Software
Cites Work
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Factoring integers with elliptic curves
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- CSIDH: an efficient post-quantum commutative group action
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- CSI-FiSh: efficient isogeny based signatures through class group computations
- Verifiable delay functions from supersingular isogenies and pairings
- SeaSign: compact isogeny signatures from class group actions
- A note on the bivariate Coppersmith theorem
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
- How to Hash into Elliptic Curves
- An attack on disguised elliptic curves
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- Statistically Hiding Sets
- The Arithmetic of Elliptic Curves
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Reducing elliptic curve logarithms to logarithms in a finite field
- Easy Decision Diffie-Hellman Groups
- New Constructions and Applications of Trapdoor DDH Groups
- Advances in Cryptology - EUROCRYPT 2004
- Constructing elliptic curve isogenies in quantum subexponential time
- Advances in Elliptic Curve Cryptography
- The Number Field Sieve in the Medium Prime Case
- Cryptography and Coding
- Algorithmic Number Theory
- 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: Trapdoor DDH groups from pairings and isogenies
