Diophantine equations and local-global principles: into the wild

丢番图方程和局部全局原理：深入实践

• 批准号: MR/T041609/1
• 负责人: Rachel Newton
• 金额: $ 131.73万
• 依托单位: University of Reading
• 依托单位国家: 英国
• 项目类别: Fellowship
• 财政年份: 2020
• 资助国家: 英国
• 起止时间: 2020 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=MR%2FT041609%2F1
• 关键词: Diophantine; equations; local; global; principles

Studying integer (whole number) solutions to polynomial equations is the oldest field in mathematics, containing problems that have remained unsolved for millennia. Furthermore, its applications to cryptography and security make it one of the most high-impact areas of pure mathematics. Cryptosystems rely on the computational hardness of mathematical problems to protect our data. The realm of integer solutions to polynomial equations is a natural source of hard problems to underpin modern cryptosystems. For example, it can claim credit for the development of elliptic curve cryptography (ECC). This is a public key cryptographic system that has been widely used for over a decade by big players such as the USA National Security Agency and Microsoft. For instance, ECC is used to protect our credit card details when we make purchases over the internet. Cybersecurity is of crucial national importance in protecting data at the individual, corporate and state level and its role in daily life is increasing as more of our economic, administrative and social interactions take place online.The deep knowledge of elliptic curves needed for the development of ECC was gained by pursuing blue sky research in mathematics, of which the most famous recent example is Andrew Wiles' 1995 proof of Fermat's Last Theorem. This concerns one particular family of polynomial equations, namely x^n+y^n = z^n. When n=2, this is Pythagoras' equation relating the side lengths of a right-angled triangle. There are infinitely many integer solutions to this equation (e.g. x = 3, y = 4, z = 5) and we even have a formula for them. However, when n is greater than 2, the behaviour is very different. Fermat conjectured in 1637 that there were no positive integer solutions to the equation x^n+y^n = z^n for n greater than 2. The proof of this fact took more than 350 years and required the development of very advanced mathematical techniques. In September 2019, Google announced that they had achieved 'quantum supremacy', having developed a quantum computer that performed a task in 200 seconds where a top-range supercomputer would take 10,000 years. This stunning achievement presents a looming crisis for the cryptosystems protecting our data. A quantum computer that can solve the mathematical problems underlying current cryptosystems in seconds rather than millennia would be able to decrypt encrypted data and compromise its security. Security agencies and technology companies are urgently seeking new, and harder, mathematical problems to underlie post-quantum cryptographic systems and they are keen to collaborate with mathematicians to achieve this.My proposal is to study integer solutions to a much larger and more complex class of polynomial equations than elliptic curves, using a wide variety of techniques from number theory, algebra, geometry and analysis. The modern approach looks first for so-called local solutions and then investigates whether a collection of them can be patched together to form a global (meaning integer) solution. However, this local-global method is not always successful. I will study the reasons for its failure and conduct a statistical analysis of the frequency of these failures within families of equations. I will break new ground by tackling cases that have so far been untouched due to their complexity: the 'wild' in my title is an adjective used by mathematicians to describe mathematical objects whose behaviour is particularly difficult to handle. Recent breakthroughs in number theory mean the time is ripe to grapple with these wild problems. I will collaborate with leading cryptographers to explore possibilities arising from my research for new hard mathematical problems that can be used to underpin cryptosystems that can resist attacks by quantum computers.

研究多项式方程的整数解是数学中最古老的领域，包含了数千年来一直未解决的问题。此外，它在密码学和安全方面的应用使其成为纯数学中最具影响力的领域之一。密码系统依赖于数学问题的计算难度来保护我们的数据。多项式方程的整数解领域是支撑现代密码系统的难题的自然来源。例如，它可以声称对椭圆曲线密码学（ECC）的发展有贡献。这是一种公钥加密系统，已被美国国家安全局和微软等大公司广泛使用了十多年。例如，ECC用于在我们通过互联网购物时保护我们的信用卡详细信息。网络安全在保护个人、企业和国家层面的数据方面具有至关重要的国家重要性，随着我们越来越多的经济、行政和社会互动发生在网上，网络安全在日常生活中的作用也越来越大。发展ECC所需的椭圆曲线的深入知识是通过追求数学方面的蓝天研究获得的，其中最近最著名的例子是安德鲁·怀尔斯（Andrew Wiles）1995年对费马大定理的证明。这涉及一个特殊的多项式方程族，即x^n+y^n = z^n。当n=2时，这是毕达哥拉斯关于直角三角形边长的方程。这个方程有无穷多个整数解（例如x = 3，y = 4，z = 5），我们甚至有一个公式。然而，当n大于2时，行为非常不同。费马在1637年证明，当n大于2时，方程x^n+y^n = z^n没有正整数解。这一事实的证明花了350多年的时间，需要非常先进的数学技术的发展。2019年9月，谷歌宣布他们已经实现了“量子至上”，开发了一台量子计算机，它在200秒内完成了一项任务，而顶级超级计算机需要10，000年。这一惊人的成就为保护我们数据的密码系统带来了迫在眉睫的危机。量子计算机可以在几秒钟而不是几千年内解决当前密码系统的数学问题，它将能够解密加密数据并危及其安全性。安全机构和技术公司正在迫切地寻找新的、更困难的数学问题来支撑后量子密码系统，他们热衷于与数学家合作实现这一目标。我的建议是研究一类比椭圆曲线更大、更复杂的多项式方程的整数解，使用数论、代数、几何和分析等多种技术。现代方法首先寻找所谓的局部解，然后研究它们的集合是否可以拼凑在一起形成一个全局（整数）解。然而，这种局部-全局方法并不总是成功的。我将研究其失败的原因，并对方程组中这些失败的频率进行统计分析。我将通过处理迄今为止由于其复杂性而未触及的案例来开辟新天地：我的标题中的“野生”是数学家用来描述其行为特别难以处理的数学对象的形容词。最近数论的突破意味着解决这些疯狂问题的时机已经成熟。我将与领先的密码学家合作，探索从我的研究中产生的新的硬数学问题的可能性，这些问题可用于支持可以抵抗量子计算机攻击的密码系统。

项目成果

Number fields with prescribed norms (with an appendix by Yonatan Harpaz and Olivier Wittenberg)

具有规定范数的数字字段（附录由 Yonatan Harpaz 和 Olivier Wittenberg 编写）

• DOI: 10.4171/cmh/528
• 发表时间: 2022
• 期刊: Commentarii Mathematici Helvetici
• 影响因子: 0.9
• 作者: Frei C

Explicit methods for the Hasse norm principle and applications to A n and S n extensions

哈斯范数原理的显式方法及其在 An 和 S n 扩展中的应用

• DOI: 10.1017/s0305004121000268
• 发表时间: 2021
• 期刊: Mathematical Proceedings of the Cambridge Philosophical Society
• 影响因子: 0.8
• 作者: MACEDO A