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.