关于离散对数的搜索复杂性
On Search Complexity of Discrete Logarithm
摘要:
在这项工作中,我们研究了离散对数问题的背景下,TFNP -搜索问题的复杂性类的语法保证存在一个解决方案的所有情况。我们的主要结果建立了离散对数问题的合适的变体对于复杂性类PPP是完全的,分别是PWPP,即,TFNP的子类捕获总搜索问题的解决方案,分别由鸽子洞原则,弱鸽子洞原则保证。除了回答Sotiraki,Zampetakis和Zirdelis(FOCS'18)最近的工作中的一个开放问题外,我们对PPP和PWPP的完整性结果对最近的工作有影响,证明了加密假设下TFNP问题的条件下界。特别是,他们强调,任何试图将TFNP子类(除了PWPP和PPP)的平均情况硬度建立在离散对数问题的平均情况硬度上的尝试,都必须利用其结构特性,而不仅仅是构造抗碰撞哈希函数所必需的。此外,我们的减少提供了新的结构的见解类PWPP建立两个新的PWPP完全的问题。首先,问题DOVE,一个松弛的PPP-完全问题PIGEON。DOVE是第一个没有用显式收缩函数定义的PWPP完全问题。第二,问题爪,一个总的搜索问题捕获的计算复杂性打破无爪排列。在TFNP的上下文中,CLAW的PWPP-完全性匹配在密码学文献中建立的抗碰撞哈希函数和无爪排列之间的已知内在关系。
英文摘要:
In this work, we study the discrete logarithm problem in the context of TFNP - the complexity class of search problems with a syntactically guaranteed existence of a solution for all instances. Our main results establish that suitable variants of the discrete logarithm problem are complete for the complexity class PPP, respectively PWPP, i.e., the subclasses of TFNP capturing total search problems with a solution guaranteed by the pigeonhole principle, respectively the weak pigeonhole principle. Besides answering an open problem from the recent work of Sotiraki, Zampetakis, and Zirdelis (FOCS'18), our completeness results for PPP and PWPP have implications for the recent line of work proving conditional lower bounds for problems in TFNP under cryptographic assumptions. In particular, they highlight that any attempt at basing average-case hardness in subclasses of TFNP (other than PWPP and PPP) on the average-case hardness of the discrete logarithm problem must exploit its structural properties beyond what is necessary for constructions of collision-resistant hash functions. Additionally, our reductions provide new structural insights into the class PWPP by establishing two new PWPP-complete problems. First, the problem DOVE, a relaxation of the PPP-complete problem PIGEON. DOVE is the first PWPP-complete problem not defined in terms of an explicitly shrinking function. Second, the problem CLAW, a total search problem capturing the computational complexity of breaking claw-free permutations. In the context of TFNP, the PWPP-completeness of CLAW matches the known intrinsic relationship between collision-resistant hash functions and claw-free permutations established in the cryptographic literature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。