Ramanujan graphs and Hecke operators

From MaRDI portal
Publication:4713014

DOI10.1090/S0273-0979-1990-15918-XzbMath0752.05035MaRDI QIDQ4713014

Arnold K. Pizer

Publication date: 25 June 1992

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)




Related Items

Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graphShift lifts preserving Ramanujan propertyThe Supersingular Isogeny Problem in Genus 2 and BeyondImproved supersingularity testing of elliptic curves using Legendre formExplicit Connections Between Supersingular Isogeny Graphs and Bruhat–Tits TreesOn isogeny graphs of supersingular elliptic curves over finite fieldsOn the hardness of the computational ring-LWR problem and its applicationsFinite fields and Ramanujan graphsOn the Isogeny Problem with Torsion Point InformationSupersingular curves you can trustOrienteering with one endomorphismAccelerating the Delfs-Galbraith algorithm with fast subfield root detectionEquitable partition for some Ramanujan graphsAutomorphisms of the supersingular isogeny graphSQISign: compact post-quantum signatures from quaternions and isogeniesB-SIDH: supersingular isogeny Diffie-Hellman using twisted torsionCSIDH: an efficient post-quantum commutative group actionDeterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automataComputational problems in supersingular elliptic curve isogeniesLaplace eigenvalues of graphs---a surveyKeyed hash function from large girth expander graphsIdentifying supersingular elliptic curvesThe spectral geometry of \(k\)-regular groupsGeneralized Group–Subgroup Pair GraphsRamanujan Graphs for Post-Quantum CryptographyConstructing cycles in isogeny graphs of supersingular elliptic curvesIdentification protocols and signature schemes based on supersingular isogeny problemsEndomorphism rings of supersingular elliptic curves over \(\mathbb{F}_p\)Cryptographic hash functions from expander graphsSplit orders and convex polytopes in buildingsConstructing an efficient hash function from $3$-isogeniesExplicit Near-Ramanujan Graphs of Every DegreeInterlacing families. I: Bipartite Ramanujan graphs of all degrees



Cites Work