50 research outputs found
Ramanujan graphs in cryptography
In this paper we study the security of a proposal for Post-Quantum
Cryptography from both a number theoretic and cryptographic perspective.
Charles-Goren-Lauter in 2006 [CGL06] proposed two hash functions based on the
hardness of finding paths in Ramanujan graphs. One is based on
Lubotzky-Phillips-Sarnak (LPS) graphs and the other one is based on
Supersingular Isogeny Graphs. A 2008 paper by Petit-Lauter-Quisquater breaks
the hash function based on LPS graphs. On the Supersingular Isogeny Graphs
proposal, recent work has continued to build cryptographic applications on the
hardness of finding isogenies between supersingular elliptic curves. A 2011
paper by De Feo-Jao-Pl\^{u}t proposed a cryptographic system based on
Supersingular Isogeny Diffie-Hellman as well as a set of five hard problems. In
this paper we show that the security of the SIDH proposal relies on the
hardness of the SIG path-finding problem introduced in [CGL06]. In addition,
similarities between the number theoretic ingredients in the LPS and Pizer
constructions suggest that the hardness of the path-finding problem in the two
graphs may be linked. By viewing both graphs from a number theoretic
perspective, we identify the similarities and differences between the Pizer and
LPS graphs.Comment: 33 page
Geometry of infinitely presented small cancellation groups, Rapid Decay and quasi-homomorphisms
We study the geometry of infinitely presented groups satisfying the small
cancelation condition C'(1/8), and define a standard decomposition (called the
criss-cross decomposition) for the elements of such groups. We use it to prove
the Rapid Decay property for groups with the stronger small cancelation
property C'(1/10). As a consequence, the Metric Approximation Property holds
for the reduced C*-algebra and for the Fourier algebra of such groups. Our
method further implies that the kernel of the comparison map between the
bounded and the usual group cohomology in degree 2 has a basis of power
continuum. The present work can be viewed as a first non-trivial step towards a
systematic investigation of direct limits of hyperbolic groups.Comment: 40 pages, 8 figure
Expansion in perfect groups
Let Ga be a subgroup of GL_d(Q) generated by a finite symmetric set S. For an
integer q, denote by Ga_q the subgroup of Ga consisting of the elements that
project to the unit element mod q. We prove that the Cayley graphs of Ga/Ga_q
with respect to the generating set S form a family of expanders when q ranges
over square-free integers with large prime divisors if and only if the
connected component of the Zariski-closure of Ga is perfect.Comment: 62 pages, no figures, revision based on referee's comments: new ideas
are explained in more details in the introduction, typos corrected, results
and proofs unchange