2,364 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
On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions
Courant theorem provides an upper bound for the number of nodal domains of
eigenfunctions of a wide class of Laplacian-type operators. In particular, it
holds for generic eigenfunctions of quantum graph. The theorem stipulates that,
after ordering the eigenvalues as a non decreasing sequence, the number of
nodal domains of the -th eigenfunction satisfies . Here,
we provide a new interpretation for the Courant nodal deficiency in the case of quantum graphs. It equals the Morse index --- at a
critical point --- of an energy functional on a suitably defined space of graph
partitions. Thus, the nodal deficiency assumes a previously unknown and
profound meaning --- it is the number of unstable directions in the vicinity of
the critical point corresponding to the -th eigenfunction. To demonstrate
this connection, the space of graph partitions and the energy functional are
defined and the corresponding critical partitions are studied in detail.Comment: 22 pages, 6 figure
- …