Algorithmic Problems in Number Theory

9970409数字字段筛是将整数分解为质数的最新算法。研究者正在继续探索有关数场筛的理论和实践问题。他还继续研究一维交换代数的基本计算工具，包括快速傅里叶变换和快速幂级数幂。房利美副主席兼总统关键基础设施保护委员会咨询委员会联合主席Jamie S. Gorelick说：“今天，一小群技术娴熟的人就能破坏我们的金融、电信、电力、供水系统和应急服务系统所依赖的计算机和互联网连接。”“网络空间很可能成为这个国家的下一个战场。”研究者的工作与公钥密码学直接相关，包括公钥签名系统，这是保护互联网通信完整性的主要工具。调查人员的研究精确地显示了攻击者需要多长时间才能破解最流行的公钥系统；这些信息对于想要选择安全系统的用户至关重要。研究者的研究还减少了使用这些系统所需的计算机时间。同样的研究也适用于许多其他计算机问题，包括医学图像处理。

9970409The number field sieve is the latest algorithm for factoring integers into primes. The investigator is continuing to explore theoretical and practical problems related to the number field sieve. He is also continuing his research into the fundamental computational tools in one-dimensional commutative algebra, including fast Fourier transforms and fast power series exponentiation."Today, a small group of technically sophisticated people could disrupt the computers and the Internet connections on which our finance, telecommunications, power, water systems, emergency service systems all depend," says Jamie S. Gorelick, Vice Chair of Fannie Mae and Co-Chair of the Advisory Committee of the President's Commission on Critical Infrastructure Protection. "Cyberspace is likely to be the next battlefield for this nation." The investigator's work is directly relevant to public-key cryptography, including public-key signature systems, the main tool for protecting the integrity of Internet communications. The investigator's research shows precisely how long it would take an attacker to break the most popular public-key systems; this information is crucial for users who want to choose safe systems. The investigator's research also reduces the amount of computer time necessary to use these systems. The same research is useful in many other computer problems, including medical image processing.