Better path-finding algorithms in LPS Ramanujan graphs

DOI10.1515/JMC-2017-0051MaRDI QIDQ1755951zbMATH OpenOpenAlexWikidataFDO

Authors Eduardo Carvalho Pinto, Christophe Petit

Publication date 11 January 2019

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL http://pure-oai.bham.ac.uk/ws/files/57179283/better_path_finding.pdf

zbMATH Keywords

Cayley graphcryptographypath finding algorithmTillich-Zémor hash function

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Cryptography (94A60)

Recommendations

• Ramanujan graphs in cryptography
• Collisions for the LPS Expander Graph Hash Function
• Ramanujan graphs for post-quantum cryptography
• scientific article; zbMATH DE number 7623647
• Cryptographic hash functions from expander graphs

Cites work

• Collisions for the LPS Expander Graph Hash Function
• Complexity of Strong Approximation on the Sphere
• Computing Modular Polynomials
• Cryptographic hash functions from expander graphs
• Expander graphs and their applications
• Full Cryptanalysis of LPS and Morgenstern Hash Functions
• Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
• scientific article; zbMATH DE number 48345 (Why is no real title available?)
• scientific article; zbMATH DE number 1849959 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• Optimal ancilla-free Pauli+V circuits for axial rotations
• Ramanujan graphs

Cited in

(1)

• Ramanujan graphs in cryptography

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Better path-finding algorithms in LPS Ramanujan graphs

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