Pages that link to "Item:Q4713014"
From MaRDI portal
The following pages link to Ramanujan graphs and Hecke operators (Q4713014):
Displayed 33 items.
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- Improved supersingularity testing of elliptic curves using Legendre form (Q831974) (← links)
- Cryptographic hash functions from expander graphs (Q1027970) (← links)
- Split orders and convex polytopes in buildings (Q1038483) (← links)
- Finite fields and Ramanujan graphs (Q1362096) (← links)
- On isogeny graphs of supersingular elliptic curves over finite fields (Q1633305) (← links)
- On the hardness of the computational ring-LWR problem and its applications (Q1633465) (← links)
- CSIDH: an efficient post-quantum commutative group action (Q1710683) (← links)
- The spectral geometry of \(k\)-regular groups (Q1803634) (← links)
- Computational problems in supersingular elliptic curve isogenies (Q1994699) (← links)
- Constructing cycles in isogeny graphs of supersingular elliptic curves (Q2048187) (← links)
- Endomorphism rings of supersingular elliptic curves over \(\mathbb{F}_p\) (Q2302571) (← links)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees (Q2352911) (← links)
- Shift lifts preserving Ramanujan property (Q2361560) (← links)
- SQISign: compact post-quantum signatures from quaternions and isogenies (Q2692337) (← links)
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion (Q2692391) (← links)
- Constructing an efficient hash function from $3$-isogenies (Q3121482) (← links)
- Generalized Group–Subgroup Pair Graphs (Q4964362) (← links)
- Ramanujan Graphs for Post-Quantum Cryptography (Q4964366) (← links)
- The Supersingular Isogeny Problem in Genus 2 and Beyond (Q5041219) (← links)
- Explicit Connections Between Supersingular Isogeny Graphs and Bruhat–Tits Trees (Q5048626) (← links)
- Keyed hash function from large girth expander graphs (Q5086121) (← links)
- On the Isogeny Problem with Torsion Point Information (Q5087255) (← links)
- Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata (Q5151246) (← links)
- Identifying supersingular elliptic curves (Q5169642) (← links)
- Explicit Near-Ramanujan Graphs of Every Degree (Q5856148) (← links)
- Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph (Q5880205) (← links)
- Identification protocols and signature schemes based on supersingular isogeny problems (Q5919490) (← links)
- Supersingular curves you can trust (Q6061368) (← links)
- Orienteering with one endomorphism (Q6093270) (← links)
- Accelerating the Delfs-Galbraith algorithm with fast subfield root detection (Q6108984) (← links)
- Equitable partition for some Ramanujan graphs (Q6174759) (← links)
- Automorphisms of the supersingular isogeny graph (Q6185634) (← links)