Logo

Mathematical Sciences Research Institute

Home » Clay Mathematics Institute Introductory Workshop in Algorithmic Number Theory

Workshop

Clay Mathematics Institute Introductory Workshop in Algorithmic Number Theory August 14, 2000 - August 23, 2000
Registration Deadline: August 23, 2000 over 14 years ago
To apply for Funding you must register by: May 14, 2000 over 14 years ago
Parent Program: Algorithmic Number Theory
Organizers David Bailey, Joe Buhler (chair), Cynthia Dwork, Hendrik Lenstra Jr., Andrew Odlyzko, Bjorn Poonen, William Velez and Noriko Yui
Speaker(s)

Show List of Speakers

Description

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.


Funding & Logistics Show All Collapse

Show Funding

To apply for funding, you must register by the funding application deadline displayed above.

Students, recent Ph.D.'s, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.

Show Lodging

MSRI has preferred rates at the Rose Garden Inn, depending on room availability. Reservations may be made by calling 1-800-992-9005 OR directly on their website. Click on Corporate at the bottom of the screen and when prompted enter code MATH (this code is not case sensitive). By using this code a new calendar will appear and will show the MSRI rate on all room types available.

MSRI has preferred rates at the Hotel Durant. Reservations may be made by calling 1-800-238-7268. When making reservations, guests must request the MSRI preferred rate. If you are making your reservations on line, please go to this link and enter the promo/corporate code 123MSRI. Our preferred rate is $139 per night for a Deluxe Queen/King, based on availability.

MSRI has preferred rates of $149 - $189 plus tax at the Hotel Shattuck Plaza, depending on room availability. Guests can either call the hotel's main line at 510-845-7300 and ask for the MSRI- Mathematical Science Research Inst. discount; or go to www.hotelshattuckplaza.com and click Book Now. Once on the reservation page, click “Promo/Corporate Code“ and input the code: msri.

MSRI has preferred rates of $110 - $140 at the Berkeley Lab Guest House, depending on room availability. Reservations may be made by calling 510-495-8000 or directly on their website. Select “I am an individual traveler affiliated with MSRI”.

Additional lodging options may be found on our short term housing page.

Show Directions to Venue

Show Visa/Immigration

Schedule
Show All Collapse
Aug 14, 2000
Monday
10:00 AM - 11:00 AM
  Solving Pell's Equation
Hendrik Lenstra (Universiteit Leiden)
11:00 AM - 02:00 PM
  Fast Multiplication
Dan Bernstein
02:00 PM - 03:30 PM
  Computational Number Theory: Basic Algorithms
Stan Wagon
03:30 PM - 04:30 PM
  The greatest common divisor
Jeffrey Shallit
Aug 15, 2000
Tuesday
09:30 AM - 11:00 AM
  Smooth numbers and the quadratic sieve
Carl Pomerance (Dartmouth College)
11:00 AM - 02:00 PM
  Applications of fast multiplication
Dan Bernstein
02:00 PM - 03:30 PM
  Elliptic Curves I
Bjorn Poonen (Massachusetts Institute of Technology)
03:30 PM - 04:30 PM
  Computational number theory: Subtler basic algorithms
Stan Wagon
Aug 16, 2000
Wednesday
09:30 AM - 11:00 AM
  The number field sieve
Peter Stevenhagen
11:00 AM - 02:00 PM
  RSA: Past, present, and future
Dan Boneh (Stanford University)
02:00 PM - 03:30 PM
  Primality
Carl Pomerance (Dartmouth College)
03:30 PM - 04:30 PM
  Lattices I
Hendrik Lenstra (Universiteit Leiden)
Aug 17, 2000
Thursday
09:00 AM - 10:00 AM
  Algorithmic number theory before computers
Jeffrey Shallit
Aug 18, 2000
Friday
09:30 AM - 11:00 AM
  Lattices II
Hendrik Lenstra (Universiteit Leiden)
11:00 AM - 02:00 PM
  Lattice basis reduction algorithms in cryptanalysis
Andrew Odlyzko (Institute of Mathematics)
02:00 PM - 03:30 PM
  Positive applications of lattices to cryptography
Cynthia Dwork
03:30 PM - 04:30 PM
  Protecting communications against forgery
Dan Bernstein
Aug 21, 2000
Monday
09:30 AM - 11:00 AM
  Quantum Computation
Umesh Vazirani (University of California, Berkeley)
11:00 AM - 02:00 PM
  Number Fields
02:00 PM - 03:30 PM
  Elliptic Curves II
Bjorn Poonen (Massachusetts Institute of Technology)
03:30 PM - 04:30 PM
  Zeta functions over finite fields
Daqing Wan
Aug 22, 2000
Tuesday
09:30 AM - 11:00 AM
  Counting smooths: A practical guide
Andrew Granville (Université de Montréal)
11:00 AM - 01:00 PM
  How to get your hands on modular forms using modular symbols
William Stein (University of Washington)
01:00 PM - 02:15 PM
  Infrastructure
Christina Ballentine
02:15 PM - 03:15 PM
  Elliptic curves III
Bjorn Poonen (Massachusetts Institute of Technology)
Aug 23, 2000
Wednesday
09:30 AM - 11:00 AM
  Smooths for smoothness' sake
Andrew Granville (Université de Montréal)
11:00 AM - 02:00 PM
  L-series in algorithmic number theory
Joe Buhler (Reed College)
02:00 PM - 03:30 PM
  Congruent number problems in dimension one and two
Noriko Yui (Queen's University)
03:30 PM - 04:30 PM
  Algorithmic class field theory
Henri Cohen