Author:
Jo Hyungrok,Sugiyama Shingo,Yamasaki Yoshinori
Abstract
AbstractWe introduce a cryptographic hash function based on expander graphs, suggested by Charles et al. ’09, as one prominent candidate in post-quantum cryptography. We propose a generalized version of explicit constructions of Ramanujan graphs, which are seen as an optimal structure of expander graphs in a spectral sense, from the previous works of Lubotzky, Phillips, Sarnak ’88 and Chiu ’92. We also describe the relationship between the security of Cayley hash functions and word problems for group theory. We also give a brief comparison of LPS-type graphs and Pizer’s graphs to draw attention to the underlying hard problems in cryptography.
Reference55 articles.
1. N. Alon, V. Milman, $$\lambda _1$$, isoperimetric inequalities for graphs, and superconcentrators. J. Comb. Theory. B. 38(1), 73–88 (1985)
2. L. Babai, Á. Seress, On the diameter of permutation groups. European. J. Combin. 13(4), 231–243 (1992)
3. J.F. Basilla, On the solution of $$x^2+dy^2=m$$. P. Jpn. Acad. A-Math 80(5), 40–41 (2004)
4. J.F. Biasse, D. Jao, A. Sankar, A quantum algorithm for computing isogenies between supersingular elliptic curves. Indocrypt LNCS 8885, 428–442 (2014)
5. D.X. Charles, E.Z. Goren, K.E. Lauter, Cryptographic hash functions from expander graphs. J. Cryptol. 22(1), 93–113 (2009a)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献