Ramanujan graphs for post-quantum cryptography
From MaRDI portal
Publication:4964366
Recommendations
Cites work
- scientific article; zbMATH DE number 5306924 (Why is no real title available?)
- scientific article; zbMATH DE number 4006420 (Why is no real title available?)
- scientific article; zbMATH DE number 1210372 (Why is no real title available?)
- scientific article; zbMATH DE number 3446982 (Why is no real title available?)
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- scientific article; zbMATH DE number 1406765 (Why is no real title available?)
- scientific article; zbMATH DE number 3407760 (Why is no real title available?)
- scientific article; zbMATH DE number 3411296 (Why is no real title available?)
- A Simple Proof of Jacobi's Four-Square Theorem
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- Arithmétique des algèbres de quaternions
- Collisions for the LPS Expander Graph Hash Function
- Cryptanalysis of the Tillich-Zémor hash function
- Cryptographic hash functions from expander graphs
- Cubic Ramanujan graphs
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Expander graphs and their applications
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Factorization of Hurwitz quaternions
- Families of Ramanujan graphs and quaternion algebras
- Foundations of Cryptography
- Full Cryptanalysis of LPS and Morgenstern Hash Functions
- Groups, graphs and trees. An introduction to the geometry of infinite groups.
- Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security
- La conjecture de Weil. I
- On maximal orders of division quaternion algebras over the rational number field with certain optimal embeddings
- On the arithmetic of quaternion algebras
- On the diameter of permutation groups
- On the diameter of permutation groups.
- On the solution of \(x^2+dy^2=m\)
- Preimages for the Tillich-Zémor hash function
- Ramanujan graphs
- Ramanujan graphs and Hecke operators
- Ramanujan graphs in cryptography
- Rubik’s for Cryptographers
- Super-Golden-Gates for \(PU(2)\)
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Type numbers of Eichler orders.
- Zeta functions of graphs. A stroll through the garden
- Zur Zahlentheorie der Quaternionen-Algebren.
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(7)- Supersingular isogeny graphs in cryptography
- Ramanujan graphs in cryptography
- Better path-finding algorithms in LPS Ramanujan graphs
- Generalized group-subgroup pair graphs
- Deterministic methods for constructing Ramanujan graphs intended for use in cryptographic algorithms based on generalized cellular automata
- Expander graphs based on GRH with an application to elliptic curve cryptography
- The limit theorem with respect to the matrices on non-backtracking paths of a graph
This page was built for publication: Ramanujan graphs for post-quantum cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964366)
