Hash functions and graphs with large girths
From MaRDI portal
Recommendations
Cited in
(22)- Cryptographic hash functions from expander graphs
- Hash functions and Cayley graphs
- New Zémor-Tillich type hash functions over \(\mathrm{GL}_2 (\mathbb{F}_{p^n})\)
- Ironwood meta key agreement and authentication protocol
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Cryptanalysis of the Tillich-Zémor hash function
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
- Cryptographic hash functions and expander graphs: the end of the story?
- Cryptographic hash functions from sequences of lifted Paley graphs
- \(\mathrm{SL}_2\) homomorphic hash functions: worst case to average case reduction and short collision search
- Preimages for the Tillich-Zémor hash function
- scientific article; zbMATH DE number 7498432 (Why is no real title available?)
- Security aspects of the Cayley hash function using discrete Heisenberg group
- Keyed hash function from large girth expander graphs
- Collisions for the LPS Expander Graph Hash Function
- On 1-factorizations of bipartite Kneser graphs
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Cryptanalysis of a Cayley hash function based on affine maps in one variable over a finite field
- Faster cryptographic hash function from supersingular isogeny graphs
- Left-right Cayley hashing: a new framework for provably secure hash functions
- A compact hash function for paths in PERT networks
- Hashing and canonicalizing Notation 3 graphs
This page was built for publication: Hash functions and graphs with large girths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037494)
