Cryptographic hash functions from expander graphs
From MaRDI portal
Recommendations
- Keyed hash function from large girth expander graphs
- Cryptographic hash functions and expander graphs: the end of the story?
- Hash functions and Cayley graphs
- Cryptographic properties of the quantum hashing based on expander graphs
- Cryptographic hash functions from sequences of lifted Paley graphs
- scientific article; zbMATH DE number 177615
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography
- Cryptographic hash functions: theory and practice
Cites work
- scientific article; zbMATH DE number 1583782 (Why is no real title available?)
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 4010603 (Why is no real title available?)
- scientific article; zbMATH DE number 48345 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 1759785 (Why is no real title available?)
- scientific article; zbMATH DE number 1456817 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- An algorithm for computing modular forms on \(\Gamma_0(N)\)
- Attacking the SL 2 hashing scheme
- Computing Modular Polynomials
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Correspondances modulaires et les fonctions \(\zeta\) de courbes algébriques
- Discrete logarithm variants of VSH
- Eigenvalues and expanders
- Fast algorithms for computing isogenies between elliptic curves
- Hash functions and Cayley graphs
- On the security of the hashing scheme based on \(\mathrm{SL}_2\)
- Quaternäre quadratische Formen und die Riemannsche Vermutung für die Kongruenzzetafunktion
- Ramanujan graphs
- Ramanujan graphs and Hecke operators
- Supersingular elliptic curves and maximal quaternionic orders
- VSH, an Efficient and Provable Collision-Resistant Hash Function
Cited in
(only showing first 100 items - show all)- Orienteering with one endomorphism
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Cryptographic hash functions from sequences of lifted Paley graphs
- Radical 2-isogenies and cryptographic hash functions in dimensions 1, 2 and 3
- The supersingular isogeny problem in genus 2 and beyond
- On the isogeny problem with torsion point information
- Identification protocols and signature schemes based on supersingular isogeny problems
- Computing newforms using supersingular isogeny graphs
- Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications
- Expanders and right-angled Artin groups
- Improved supersingularity testing of elliptic curves using Legendre form
- Orientations and the supersingular endomorphism ring problem
- Counting Richelot isogenies between superspecial abelian surfaces
- Computing supersingular endomorphism rings using inseparable endomorphisms
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Neighborhood of vertices in the isogeny graph of principally polarized superspecial abelian surfaces
- An efficient collision attack on Castryck-Decru-Smith's hash function
- Rational isogenies from irrational endomorphisms
- Distribution of cycles in supersingular -isogeny graphs
- SILBE: an updatable public key encryption scheme from lollipop attacks
- Cryptanalysis of a Cayley hash function based on affine maps in one variable over a finite field
- Ramanujan graphs in cryptography
- Spectrum of random d‐regular graphs up to the edge
- Some graph-based encryption schemes
- How not to create an isogeny-based PAKE
- SimS: a simplification of SiGamal
- Geometry and Combinatorics via Right-Angled Artin Groups
- Exponential speedup of quantum algorithms for the pathfinding problem
- Faster isogenies for post-quantum cryptography: SIKE
- From graphs to keyed quantum hash functions
- On random sampling of supersingular elliptic curves
- New Zémor-Tillich type hash functions over \(\mathrm{GL}_2 (\mathbb{F}_{p^n})\)
- Efficient post-quantum undeniable signature on 64-bit ARM
- Higher-degree supersingular group actions
- Computing isogeny volcanoes of composite degree
- On division polynomial PIT and supersingularity
- Super-expanders and warped cones
- Loops, multi-edges and collisions in supersingular isogeny graphs
- Encryption and decryption using decomposition of complete graph \(K_{3(6n+1)}\)
- On the efficient representation of isogenies. A survey for NuTMiC 2024
- Multiradical isogenies
- On the cost of computing isogenies between supersingular elliptic curves
- A signature scheme constructed from zero knowledge argument of knowledge for the subgraph isomorphism problem
- DeCSIDH: delegating isogeny computations in the CSIDH setting
- Hash functions from superspecial genus-2 curves using Richelot isogenies
- Better path-finding algorithms in LPS Ramanujan graphs
- SHealS and HealS: Isogeny-Based PKEs from a Key Validation Method for SIDH
- Quantum security analysis of CSIDH
- On the quaternion -isogeny path problem
- Constructing an efficient hash function from 3-isogenies
- Computational problems in supersingular elliptic curve isogenies
- A Probabilistic Study on Combinatorial Expanders and Hashing
- On isogeny graphs of supersingular elliptic curves over finite fields
- On the hardness of the computational ring-LWR problem and its applications
- Radical isogenies
- A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE
- Orienting supersingular isogeny graphs
- Explicit connections between supersingular isogeny graphs and Bruhat-Tits trees
- A heuristic subexponential algorithm to find paths in Markoff graphs over finite fields
- Hash Functions from Sigma Protocols and Improvements to VSH
- On the supersingular GPST attack
- scientific article; zbMATH DE number 177615 (Why is no real title available?)
- Radical isogenies and modular curves
- \(\mathrm{SL}_2\) homomorphic hash functions: worst case to average case reduction and short collision search
- Parallel isogeny path finding with limited memory
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- New techniques for SIDH-based NIKE
- Keyed hash function from large girth expander graphs
- Modular polynomials on Hilbert surfaces
- Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph
- Post-quantum hash functions using \(\operatorname{SL}_n (\mathbb{F}_p)\)
- Analogues of Vélu's formulas for isogenies on alternate models of elliptic curves
- Generalized group-subgroup pair graphs
- A trade-off between classical and quantum circuit size for an attack against CSIDH
- Algebraic approaches for solving isogeny problems of prime power degrees
- Towards isogeny-based password-authenticated key establishment
- On affine forestry over integral domains and families of deep Jordan-Gauss graphs
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Constructing cycles in isogeny graphs of supersingular elliptic curves
- Radical isogenies on Montgomery curves
- Supersingular curves you can trust
- Efficient (3, 3)-isogenies on fast Kummer surfaces
- SQISign: compact post-quantum signatures from quaternions and isogenies
- A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
- Orientations and cycles in supersingular isogeny graphs
- Supersingular non-superspecial abelian surfaces in cryptography
- Left-right Cayley hashing: a new framework for provably secure hash functions
- Faster proofs and VRFs from isogenies
- Proving knowledge of isogenies: a survey
- Automorphisms of the supersingular isogeny graph
- Efficient computation of (3ⁿ,3ⁿ)-isogenies
- Unconditional foundations for supersingular isogeny-based cryptography
- An effective lower bound on the number of orientable supersingular elliptic curves
- Faster cryptographic hash function from supersingular isogeny graphs
- A new adaptive attack on SIDH
- On the Security of Supersingular Isogeny Cryptosystems
- Spectral theory of isogeny graphs
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- A post-quantum round-optimal oblivious PRF from isogenies
- Ramanujan graphs for post-quantum cryptography
This page was built for publication: Cryptographic hash functions from expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027970)
