Algorithms in number theory and cryptography

数论和密码学中的算法

• 批准号: 238981-2011
• 负责人: Jacobson, Jr, Michael
• 金额: $ 2.4万
• 依托单位: University of Calgary
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2014
• 资助国家: 加拿大
• 起止时间: 2014-01-01 至 2015-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=547156
• 关键词: Algorithms; number; theory; cryptography

In the past few decades, cryptography, the study of data security, has emerged as an important concern in our society. As information becomes increasingly accessible through the Internet, the need to protect and authenticate data is more imperative than ever. The security of many methods in modern public-key cryptography relies on the supposed difficulty of certain computational problems in mathematics and, in particular, number theory. These schemes are set up in such a way that presumably the only way for an attacker to break the given system is to solve an instance of one such problem. Currently, only three number-theoretic problems are widely accepted as foundations for secure public-key protocols. Furthermore, these three problems have strong theoretical relationships. In many cases, being able to solve one efficiently implies the ability to solve the other two efficiently as well. In other words, one dramatic mathematical discovery could render many current public-key cryptographic techniques insecure.

在过去的几十年里，研究数据安全的密码学已经成为我们社会关注的一个重要问题。随着信息越来越多地通过互联网访问，保护和验证数据的需求比以往任何时候都更加迫切。现代公钥密码学中许多方法的安全性依赖于数学中某些计算问题的假定难度，尤其是数论。这些方案的设置方式可能使攻击者破坏给定系统的唯一方法是解决一个此类问题的实例。目前，只有三个数论问题被广泛接受为安全公钥协议的基础。此外，这三个问题具有很强的理论关联性。在许多情况下，能够有效地解决一个问题意味着也能够有效地解决另外两个问题。换句话说，一项戏剧性的数学发现可能会使许多当前的公钥密码技术变得不安全。