Hash functions and Cayley graphs
From MaRDI portal
Publication:1335422
DOI10.1007/BF01388652zbMath0807.94012OpenAlexW1484626591MaRDI QIDQ1335422
Publication date: 1 November 1994
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01388652
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other geometric groups, including crystallographic groups (20H15)
Related Items (14)
Shift lifts preserving Ramanujan property ⋮ Chaotic hash function based on the dynamic S-box with variable parameters ⋮ Cryptanalysis of the Tillich-Zémor hash function ⋮ Cayley sum graphs and their applications to codebooks ⋮ Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) ⋮ Groups with a Cayley graph isomorphic to a hypercube ⋮ Keyed hash function from large girth expander graphs ⋮ Unnamed Item ⋮ New Zémor-Tillich type hash functions over \(\mathrm{GL}_2 (\mathbb{F}_{p^n})\) ⋮ Pseudorandom Graphs from Elliptic Curves ⋮ Collisions for the LPS Expander Graph Hash Function ⋮ Preimages for the Tillich-Zémor Hash Function ⋮ Dynamics of continued fractions with periodic constraints ⋮ Cryptographic hash functions from expander graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Small-diameter Cayley graphs for finite simple groups
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- The complexity of finding minimum-length generator sequences
- Ramanujan graphs
- Explicit constructions of graphs without short cycles and low density codes
- Diameters and Eigenvalues
This page was built for publication: Hash functions and Cayley graphs
