arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0212055cs.CRcs.CC
收藏

现代密码学的数学基础:计算复杂性透视

Mathematical foundations of modern cryptography: computational complexity perspective

Shafi Goldwasser

摘要:

理论计算机科学已经在数学的许多领域找到了肥沃的土壤。这种方法一直是通过计算复杂性的棱镜来考虑经典问题,其中解决问题所采取的基本计算步骤的数量是关键的定性参数。这种新的方法导致了一系列的进步,在设置和解决新的数学挑战,以及在利用离散数学解决现实世界的问题的任务。在这次演讲中,我将从这个角度来审视现代密码学的发展--秘密通信和协议背后的数学。我将描述加密任务的复杂性理论基础,伪随机数生成器和函数,零知识交互式证明和多方安全协议。我将试图强调范式和证明技术,统一这些基础,并已进入复杂性理论的主流。

英文摘要:

Theoretical computer science has found fertile ground in many areas of mathematics. The approach has been to consider classical problems through the prism of computational complexity, where the number of basic computational steps taken to solve a problem is the crucial qualitative parameter. This new approach has led to a sequence of advances, in setting and solving new mathematical challenges as well as in harnessing discrete mathematics to the task of solving real-world problems. In this talk, I will survey the development of modern cryptography -- the mathematics behind secret communications and protocols -- in this light. I will describe the complexity theoretic foundations underlying the cryptographic tasks of encryption, pseudo-randomness number generators and functions, zero knowledge interactive proofs, and multi-party secure protocols. I will attempt to highlight the paradigms and proof techniques which unify these foundations, and which have made their way into the mainstream of complexity theory.

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

↑