Random Cayley digraphs and the discrete logarithm
From MaRDI portal
Recommendations
Cited in
(6)- Expander graphs based on GRH with an application to elliptic curve cryptography
- On random walks for Pollard's rho method
- scientific article; zbMATH DE number 4069911 (Why is no real title available?)
- Combinatorial logarithm and point-determining cographs
- Random walks revisited: Extensions of Pollard's rho algorithm for computing multiple discrete logarithms
- Random Cayley graphs with \(O(\log|G|)\) generators are expanders
This page was built for publication: Random Cayley digraphs and the discrete logarithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737503)