SITE MAP

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

SEARCH

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

SHORTCUT:


 

Clay Mathematics Institute Introductory Workshop in Algorithmic Number Theory

August 14, 2000 to August 23, 2000
Organized By: David Bailey, Joe Buhler (chair), Cynthia Dwork, Hendrik Lenstra Jr., Andrew Odlyzko, Bjorn Poonen, William Velez and Noriko Yui
 
Parent Programs:
Algorithmic Number Theory
 
Participant List:
View a List of Registered Participants
 
This workshop will have lecture series covering the basic areas of algorithmic number theory,
aimed at graduate students and mathematicians without extensive experience in the field.

The topics covered will include:

Basic Number Theoretic Algorithms
Primality and Factorization
Computations in Algebraic Number Fields
Elliptic Curves
Cryptography
Lattice Basis Reduction
Analytic Number Theory Algorithms

A related event follows on the UC Berkeley campus: a 3-day conference in honor of the Lehmers;
see http://www.math.berkeley.edu/lehmer.html for information.
 
 

For more information:
Questions about this workshop should be sent either by email to


or by regular mail to:

The Institute is committed to the principles of Equal Opportunity and Affirmative Action.

 
Back to Workshop Listing
Want to be kept updated on upcoming events? Then Click Here to Subscribe to Our Newsletters!