AMS Sectional Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:10:30
Program 
Deadlines 
Registration/Housing/Etc. 
Inquiries: meet@ams.org
2003 Spring Central Section Meeting
Bloomington, IN, April 46, 2003
Meeting #985
Associate secretaries:
Susan J Friedlander, AMS
susan@math.northwestern.edu
Special Session on Cryptography and Computational and Algorithmic Number Theory

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, RoseHulman Institute of Technology holden@rosehulman.edu
John Rickert, RoseHulman Institute of Technology john.rickert@rosehulman.edu
Jonathan Sorenson, Butler University sorenson@butler.edu
Andreas Stein, University of Illinois at UrbanaChampaign 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
(98511261)

2:30 p.m.
A note on the RamanujanNagell equation.
Emanuel Herrmann, Universitat des Saarlandes
Florian Luca, Instituto de Matematicas UNAM
P. G. Walsh*, University of Ottawa
(9851131)

3:00 p.m.
Break

3:30 p.m.
Randomized primality proving in essentially quartic time.
Daniel J. Bernstein*, University of Illinois at Chicago
(98511210)

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
(98511287)

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, RoseHulman Institute of Technology holden@rosehulman.edu
John Rickert, RoseHulman Institute of Technology john.rickert@rosehulman.edu
Jonathan Sorenson, Butler University sorenson@butler.edu
Andreas Stein, University of Illinois at UrbanaChampaign andreas@math.uiuc.edu

8:30 a.m.
NUCOMP I  Idea and Algorithm.
Renate Scheidler*, University of Calgary
(98511245)

9:00 a.m.
NUCOMP II  Implementation and Applications.
Michael J Jacobson*, University of Calgary / CISaC
(98511204)

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
(98511244)

10:00 a.m.
Break

10:30 a.m.
Tatepairing implementations for tripartite keyagreement.
Iwan M Duursma*, Univ of Illinois at UC
HyangSook Lee, Ewha Womans University
(98511265)

11:00 a.m.
PermutationSensitive Signatures.
Eric Bach*, University of Wisconsin
(98511280)

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, RoseHulman Institute of Technology holden@rosehulman.edu
John Rickert, RoseHulman Institute of Technology john.rickert@rosehulman.edu
Jonathan Sorenson, Butler University sorenson@butler.edu
Andreas Stein, University of Illinois at UrbanaChampaign andreas@math.uiuc.edu

3:00 p.m.
On the Computation of Cube Roots Modulo $p$.
Siguna M.S. M\"uller*, University of Calgary
(98511312)

3:30 p.m.
A Numerical Technique for the Number Field Sieve Square Root.
Chris Monico*, University of Notre Dame
(98511215)

4:00 p.m.
Computing the nesting depth of a nested radical.
Oliver A Schirokauer*, Oberlin College
(98511308)

4:30 p.m.
On Class Group Computations Using the Number Field Sieve.
Safuat Hamdy*, University of Calgary
(98511191)

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, RoseHulman Institute of Technology holden@rosehulman.edu
John Rickert, RoseHulman Institute of Technology john.rickert@rosehulman.edu
Jonathan Sorenson, Butler University sorenson@butler.edu
Andreas Stein, University of Illinois at UrbanaChampaign andreas@math.uiuc.edu

9:00 a.m.
Are there enough primes for cryptography?
Samuel S Wagstaff*, Purdue University
(9851128)

9:30 a.m.
FPGABased Hyperelliptic Curve Cryptosystems.
T. Charles Clancy*, University of Illinois
(9859478)

10:00 a.m.
Break

10:30 a.m.
Asymptotically fast group operations on Jacobians of general curves.
Kamal KhuriMakdisi*, Center for Advanced Mathematical Sciences, American University of Beirut
(98514187)

11:30 a.m.
Some comments on group independent secret sharing schemes.
Brian S King*, Purdue School of Eng. & Tech., IUPUI
(9859424)
Inquiries: meet@ams.org