Workshop on Algorithmic Number Theory

将为35名学院和大学教职员工举办为期五天的关于算术数理论最新发展的研讨会。工作坊将向学员介绍可用于加强本科生数论、代数和计算理论课程的主题。它将包括埃里克·巴赫的十次一小时的说明性演讲，关于这一主题的计算机作业，以及参与者之间关于将这些主题纳入他们的课堂的讨论。讲座将讨论数论中的经典算法，有限域的算法，以及素性检验、因式分解和离散对数的方法。除了它们对数学家的内在兴趣外，这些算法在密码学、伪随机数生成和计算机代数中也很有用。还将讨论其他应用。

A five-day workshop on recent developments in algorithmic number theory will be conducted for 35 college and university faculty. The workshop will introduce participants to topics that can be used to enhance undergraduate courses in number theory, algebra, and the theory of computation. It will include ten one-hour expository lectures by Eric Bach, computer assignments on the topic, and discussions among participants about inclusion of these topics in their classes. The lectures will discuss classical algorithms in number theory, algorithms for finite fields, and methods for primality testing, factoring, and discrete logarithms. Besides their intrinsic interest to number theorists, these algorithms are useful in cryptography, pseudo-random number generation, and computer algebra. Other applications will also be discussed.