Applications of Ramanujan Graphs in Cryptography. Kristin Lauter Microsoft Research Cryptography Group IPAM Expander Graphs and Applications February 12, 2008. joint work. with Denis Charles and Eyal Goren: Cryptographic hash functions from expander graphs , Journal of Cryptology, 2007
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Microsoft Research Cryptography Group
IPAM Expander Graphs and Applications
February 12, 2008
with Denis Charles and Eyal Goren:
Input: a bit string
Output: label of the final vertex of the walk
Finding collisions reduces to finding isogenies between elliptic curves:
Theorem. If ell lies over l with residue degree f, then
Choose p such that the graph is undirected.