Faster cryptographic hash function from supersingular isogeny graphs
From MaRDI portal
Publication:6619856
DOI10.1007/978-3-031-58411-4_18zbMATH Open1547.94354MaRDI QIDQ6619856
Javad Doliskani, Geovandro C. C. F. Pereira, Paulo S. L. M. Barreto
Publication date: 16 October 2024
Applications of graph theory (05C90) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Isogeny (14K02) Quantum cryptography (quantum-theoretic aspects) (81P94) Expander graphs (05C48)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Cryptographic hash functions from expander graphs
- Claw finding algorithms using quantum walk
- Hash functions and Cayley graphs
- Computing isogenies between Montgomery curves using the action of \((0,0)\)
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Endomorphisms of Abelian varieties over finite fields
- Analogues of Vélu's formulas for isogenies on alternate models of elliptic curves
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
- Isogeny volcanoes
- Twisted Edwards Curves
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- The Arithmetic of Elliptic Curves
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Quantum algorithms revisited
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- On the Power of Quantum Computation
- Ramanujan graphs and Hecke operators
- A normal form for elliptic curves
- Computing and Combinatorics
This page was built for publication: Faster cryptographic hash function from supersingular isogeny graphs
