AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:10:30

Associate secretaries:
Susan J Friedlander, AMS susan@math.northwestern.edu

Friday April 4, 2003, 2:00 p.m.-5:15 p.m.
Special Session on Cryptography and Computational and Algorithmic Number Theory, I
Room 004, Woodburn Hall
Organizers:
Joshua Holden, Rose-Hulman Institute of Technology holden@rose-hulman.edu
John Rickert, Rose-Hulman Institute of Technology john.rickert@rose-hulman.edu
Jonathan Sorenson, Butler University sorenson@butler.edu
Andreas Stein, University of Illinois at Urbana-Champaign andreas@math.uiuc.edu
- 2:00 p.m.
  On fixed points for discrete logarithms.
  Mariana Campbell*, University of Pennsylvania
  Carl Pomerance, Bell Laboratories, Lucent Technologies
  (985-11-261)
- 2:30 p.m.
  A note on the Ramanujan-Nagell equation.
  Emanuel Herrmann, Universitat des Saarlandes
  Florian Luca, Instituto de Matematicas UNAM
  P. G. Walsh*, University of Ottawa
  (985-11-31)
- 3:00 p.m.
  Break
- 3:30 p.m.
  Randomized primality proving in essentially quartic time.
  Daniel J. Bernstein*, University of Illinois at Chicago
  (985-11-210)
- 4:30 p.m.
  Primality testing with Gaussian periods.
  H. W, Lenstra, Jr., University of California at Berkeley and Leiden University
  Carl Pomerance*, Bell Labs, Lucent Technologies
  (985-11-287)

Saturday April 5, 2003, 8:30 a.m.-11:20 a.m.
Special Session on Cryptography and Computational and Algorithmic Number Theory, II
Room 205, Ballantine Hall
Organizers:
Joshua Holden, Rose-Hulman Institute of Technology holden@rose-hulman.edu
John Rickert, Rose-Hulman Institute of Technology john.rickert@rose-hulman.edu
Jonathan Sorenson, Butler University sorenson@butler.edu
Andreas Stein, University of Illinois at Urbana-Champaign andreas@math.uiuc.edu
- 8:30 a.m.
  NUCOMP I - Idea and Algorithm.
  Renate Scheidler*, University of Calgary
  (985-11-245)
- 9:00 a.m.
  NUCOMP II - Implementation and Applications.
  Michael J Jacobson*, University of Calgary / CISaC
  (985-11-204)
- 9:30 a.m.
  Some results concerning periodic continued fractions.
  Roger Patterson, Macquarie University
  Alf J van der Poorten, Macquarie University
  Hugh C Williams*, University of Calgary
  (985-11-244)
- 10:00 a.m.
  Break
- 10:30 a.m.
  Tate-pairing implementations for tripartite key-agreement.
  Iwan M Duursma*, Univ of Illinois at U-C
  Hyang-Sook Lee, Ewha Womans University
  (985-11-265)
- 11:00 a.m.
  Permutation-Sensitive Signatures.
  Eric Bach*, University of Wisconsin
  (985-11-280)

Saturday April 5, 2003, 3:00 p.m.-4:50 p.m.
Special Session on Cryptography and Computational and Algorithmic Number Theory, III
Room 205, Ballantine Hall
Organizers:
Joshua Holden, Rose-Hulman Institute of Technology holden@rose-hulman.edu
John Rickert, Rose-Hulman Institute of Technology john.rickert@rose-hulman.edu
Jonathan Sorenson, Butler University sorenson@butler.edu
Andreas Stein, University of Illinois at Urbana-Champaign andreas@math.uiuc.edu
- 3:00 p.m.
  On the Computation of Cube Roots Modulo $p$.
  Siguna M.S. M\"uller*, University of Calgary
  (985-11-312)
- 3:30 p.m.
  A Numerical Technique for the Number Field Sieve Square Root.
  Chris Monico*, University of Notre Dame
  (985-11-215)
- 4:00 p.m.
  Computing the nesting depth of a nested radical.
  Oliver A Schirokauer*, Oberlin College
  (985-11-308)
- 4:30 p.m.
  On Class Group Computations Using the Number Field Sieve.
  Safuat Hamdy*, University of Calgary
  (985-11-191)

Sunday April 6, 2003, 9:00 a.m.-11:50 a.m.
Special Session on Cryptography and Computational and Algorithmic Number Theory, IV
Room 205, Ballantine Hall
Organizers:
Joshua Holden, Rose-Hulman Institute of Technology holden@rose-hulman.edu
John Rickert, Rose-Hulman Institute of Technology john.rickert@rose-hulman.edu
Jonathan Sorenson, Butler University sorenson@butler.edu
Andreas Stein, University of Illinois at Urbana-Champaign andreas@math.uiuc.edu
- 9:00 a.m.
  Are there enough primes for cryptography?
  Samuel S Wagstaff*, Purdue University
  (985-11-28)
- 9:30 a.m.
  FPGA-Based Hyperelliptic Curve Cryptosystems.
  T. Charles Clancy*, University of Illinois
  (985-94-78)
- 10:00 a.m.
  Break
- 10:30 a.m.
  Asymptotically fast group operations on Jacobians of general curves.
  Kamal Khuri-Makdisi*, Center for Advanced Mathematical Sciences, American University of Beirut
  (985-14-187)
- 11:30 a.m.
  Some comments on group independent secret sharing schemes.
  Brian S King*, Purdue School of Eng. & Tech., IUPUI
  (985-94-24)

Inquiries: meet@ams.org