SimS: a simplification of SiGamal
From MaRDI portal
Publication:2118549
DOI10.1007/978-3-030-81293-5_15zbMath1485.94083OpenAlexW3181067044MaRDI QIDQ2118549
Publication date: 22 March 2022
Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/149508555/FouotsaT2021SimS.pdf
Related Items (4)
Radical Isogenies on Montgomery Curves ⋮ SHealS and HealS: Isogeny-Based PKEs from a Key Validation Method for SIDH ⋮ Group action key encapsulation and non-interactive key exchange in the QROM ⋮ Post-quantum anonymous one-sided authenticated key exchange without random oracles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptographic hash functions from expander graphs
- Computing isogenies between Montgomery curves using the action of \((0,0)\)
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
- CSIDH: an efficient post-quantum commutative group action
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- CSI-FiSh: efficient isogeny based signatures through class group computations
- Radical isogenies
- SiGamal: a supersingular isogeny-based PKE and its application to a PRF
- On the Security of Supersingular Isogeny Cryptosystems
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- The Arithmetic of Elliptic Curves
- Elliptic Curve Cryptosystems
- A method for obtaining digital signatures and public-key cryptosystems
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Secure integration of asymmetric and symmetric encryption schemes
- CSIDH on the Surface
- Constructing elliptic curve isogenies in quantum subexponential time
- Advances in Cryptology - CRYPTO 2003
- Faster computation of isogenies of large prime degree
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
This page was built for publication: SimS: a simplification of SiGamal
