Cryptographic hash functions from sequences of lifted Paley graphs

DOI10.1090/CONM/677/13629MaRDI QIDQ2975257zbMATH OpenOpenAlexFDO

Authors Serena Yuan

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

zbMATH Keywords

expander graphsgraph operationshash functionslinear algebrarandom walks on graphssigned graphsweighted graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76) Random walks on graphs (05C81) Applications of graph theory (05C90) Group actions on combinatorial structures (05E18) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Cryptography (94A60)

Recommendations

• Cryptographic hash functions from expander graphs
• Hash functions and Cayley graphs
• Sequencings and Directed Graphs with Applications to Cryptography
• scientific article; zbMATH DE number 177615
• Keyed hash function from large girth expander graphs
• LEXICOGRAPHIC LABELED GRAPHS IN CRYPTOGRAPHY
• From graphs to keyed quantum hash functions
• New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach
• scientific article; zbMATH DE number 637315
• A combinatorial characterization of certain universal classes of hash functions

Cites work

• A Constructive Solution to a Tournament Problem
• Expander families and Cayley graphs. A beginner's guide
• Expander graphs and their applications
• Families of Ramanujan graphs and quaternion algebras
• Large networks and graph limits
• Lifts, discrepancy and nearly optimal spectral gap
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• On the second eigenvalue of a graph
• Pseudorandomness
• Quasi-random graphs
• Random Lifts of Graphs: Edge Expansion
• Searching for Primitive Roots in Finite Fields
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Theory of Cryptography

Cited in

(9)

• Cryptographic hash functions from expander graphs
• Hash functions and Cayley graphs
• Cryptographic hash functions and expander graphs: the end of the story?
• Fast pseudorandom functions based on expander graphs
• Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography
• Ramanujan graphs for post-quantum cryptography
• Keyed hash function from large girth expander graphs
• A Probabilistic Study on Combinatorial Expanders and Hashing
• Cryptanalysis of a Cayley hash function based on affine maps in one variable over a finite field

This page was built for publication: Cryptographic hash functions from sequences of lifted Paley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975257)