Deterministic methods for constructing Ramanujan graphs intended for use in cryptographic algorithms based on generalized cellular automata
From MaRDI portal
Recommendations
Cites work
- Cryptographic hash functions from expander graphs
- Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
- Elliptic curves. Number theory and cryptography
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Expander families and Cayley graphs. A beginner's guide
- Expander graphs and their applications
- scientific article; zbMATH DE number 4070321 (Why is no real title available?)
- scientific article; zbMATH DE number 48345 (Why is no real title available?)
- scientific article; zbMATH DE number 52254 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 2146471 (Why is no real title available?)
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- scientific article; zbMATH DE number 2115090 (Why is no real title available?)
- scientific article; zbMATH DE number 878175 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Method of acoustic sounding for an inhomogeneous two-component medium
- Ramanujan graphs
- Ramanujan graphs and Hecke operators
- Representations and characters of groups.
- The Arithmetic of Elliptic Curves
- The Magma algebra system. I: The user language
Cited in
(2)
This page was built for publication: Deterministic methods for constructing Ramanujan graphs intended for use in cryptographic algorithms based on generalized cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151246)