Keyed hash function from large girth expander graphs

zbMath1497.94112arXiv1903.06267MaRDI QIDQ5086121

Monika Polak, Eustrat Zhupa

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/1903.06267

zbMATH Keywords

authenticationexpander graphskeyed hash functionlarge girth graphs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Expander graphs (05C48)

Uses Software

• Diehard

Cites Work

• Explicit construction of regular graphs without small cycles
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Note on the girth of Ramanujan graphs
• Cryptographic hash functions from expander graphs
• The sextet construction for cubic graphs
• Girths of bipartite sextet graphs
• Ramanujan graphs
• Explicit constructions of graphs without short cycles and low density codes
• Constructions for cubic graphs with large girth
• Polarities and \(2k\)-cycle-free graphs
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Hash functions and Cayley graphs
• Explicit construction of graphs with an arbitrary large girth and of large size
• Graphs of prescribed girth and bi-degree
• On the comparison of cryptographical properties of two different families of graphs with large cycle indicator
• Expander graphs and their applications
• A new series of dense graphs of high girth
• Ramanujan graphs and Hecke operators
• Collisions for the LPS Expander Graph Hash Function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Keyed hash function from large girth expander graphs