Generalized group-subgroup pair graphs
From MaRDI portal
Publication:4964362
Recommendations
- Cayley-type graphs for group-subgroup pairs
- Ramanujan graphs for post-quantum cryptography
- Deterministic methods for constructing Ramanujan graphs intended for use in cryptographic algorithms based on generalized cellular automata
- Ramanujan graphs: an introduction
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
Cites work
- Cayley-type graphs for group-subgroup pairs
- Cryptographic hash functions from expander graphs
- scientific article; zbMATH DE number 4165188 (Why is no real title available?)
- scientific article; zbMATH DE number 51906 (Why is no real title available?)
- Mathematical modelling for next-generation cryptography. CREST Crypto-Math project
- On the second eigenvalue of a graph
- Ramanujan graphs
- Ramanujan graphs and Hecke operators
- Spectra of hypergraphs and applications
- Zeta functions of graphs. A stroll through the garden
Cited in
(4)
This page was built for publication: Generalized group-subgroup pair graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964362)