Cryptographic hash functions from sequences of lifted Paley graphs
Publication:2975257
DOI10.1090/conm/677/13629zbMath1359.05132OpenAlexW3110642110MaRDI QIDQ2975257
Publication date: 11 April 2017
Published in: Algebra and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/677/13629
weighted graphslinear algebrarandom walks on graphssigned graphsexpander graphsgraph operationshash functions
Applications of graph theory (05C90) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Cryptography (94A60) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76) Random walks on graphs (05C81) Group actions on combinatorial structures (05E18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lifts, discrepancy and nearly optimal spectral gap
- On the second eigenvalue of a graph
- Pseudorandomness
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Expander graphs and their applications
- Searching for Primitive Roots in Finite Fields
- Random Lifts of Graphs: Edge Expansion
- A Constructive Solution to a Tournament Problem
- Theory of Cryptography
- Quasi-random graphs
This page was built for publication: Cryptographic hash functions from sequences of lifted Paley graphs