Constructing an efficient hash function from 3-isogenies
From MaRDI portal
Constructing an efficient hash function from \(3\)-isogenies
Recommendations
- Hash functions from superspecial genus-2 curves using Richelot isogenies
- Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- Multiradical isogenies
- The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728
Cites work
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- Collisions for the LPS Expander Graph Hash Function
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Constructing elliptic curve isogenies in quantum subexponential time
- Cryptographic hash functions from expander graphs
- scientific article; zbMATH DE number 1456817 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Ramanujan graphs and Hecke operators
- The Arithmetic of Elliptic Curves
Cited in
(3)
This page was built for publication: Constructing an efficient hash function from \(3\)-isogenies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121482)