arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.10906cs.CRmath.NT
收藏

一种基于马尔可夫三元组的密码散列函数

A Cryptographic Hash Function from Markoff Triples

Elena Fuchs, Kristin Lauter, Matthew Litman, Austin Tran

摘要:

Charles、Goren和Lauter在[CGL]中基于图中路径难以找到的特性提出了基于扩展图的加密哈希函数。在本文中,我们提出了一个新的候选人的哈希函数的基础上,在图中的马尔可夫三元组模p.这些图已经被广泛研究,在数论和其他各种领域的硬度找到路径,但在图中找到路径仍然很困难。我们讨论的困难,找到点之间的路径,基于马尔可夫图的结构。我们研究了几种可能的攻击途径,并估计其运行时间大于O(p)。特别是,我们分析了最近在[BGS 1]中的一个突破性的证明,即这种图是连通的,并讨论了这个证明如何给出一个寻找路径的算法

英文摘要:

Cryptographic hash functions from expander graphs were proposed by Charles, Goren, and Lauter in [CGL] based on the hardness of finding paths in the graph. In this paper, we propose a new candidate for a hash function based on the hardness of finding paths in the graph of Markoff triples modulo p. These graphs have been studied extensively in number theory and various other fields, and yet finding paths in the graphs remains difficult. We discuss the hardness of finding paths between points, based on the structure of the Markoff graphs. We investigate several possible avenues for attack and estimate their running time to be greater than O(p). In particular, we analyze a recent groundbreaking proof in [BGS1] that such graphs are connected and discuss how this proof gives an algorithm for finding paths

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑