Ramanujan Graphs in Cryptography

DOI10.1007/978-3-030-19478-9_1zbMath1457.94115arXiv1806.05709OpenAlexW2952234193MaRDI QIDQ3296195

Maike Massierer, Brooke Feigon, Anna Puskás, Anamaria Costache, Kristin E. Lauter

Publication date: 7 July 2020

Published in: Association for Women in Mathematics Series (Search for Journal in Brave)

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

zbMATH Keywords

post-quantum cryptographyRamanujan graphssupersingular isogeny graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Quantum computation (81P68) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

Explicit Connections Between Supersingular Isogeny Graphs and Bruhat–Tits Trees, Automorphisms of the supersingular isogeny graph, How not to create an isogeny-based PAKE, Towards isogeny-based password-authenticated key establishment, Algebraic approaches for solving isogeny problems of prime power degrees, A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE, Ramanujan Graphs for Post-Quantum Cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cutoff on all Ramanujan graphs
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Cryptographic hash functions from expander graphs
• Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
• Ramanujan graphs
• Eigenvalues and expanders
• Arithmétique des algèbres de quaternions
• An algorithm for computing modular forms on \(\Gamma_0(N)\)
• The representability of modular forms by theta series
• On isogeny graphs of supersingular elliptic curves over finite fields
• Diameter of Ramanujan graphs and random Cayley graphs
• Full Cryptanalysis of LPS and Morgenstern Hash Functions
• The Arithmetic of Elliptic Curves
• Automorphic Forms on Adele Groups. (AM-83)
• Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms
• Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
• Collisions for the LPS Expander Graph Hash Function