American Mathematical Society

My Account · My Cart · Customer Services · FAQ  

AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:21:29


Program  |  Deadlines  |  Registration/Housing/Etc.  |  Inquiries:  meet@ams.org

2001 Fall Central Section Meeting
Columbus, OH, September 21-23, 2001
Meeting #969

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

Special Session on Cryptography and Computational and Algorithmic Number Theory

  • Friday September 21, 2001, 1:30 p.m.-5:20 p.m.
    Special Session on Cryptography and Computational and Algorithmic Number Theory, I

    UH 0047, University Hall (UH)
    Organizers:
    Eric Bach, University of Wisconsin-Madison bach@cs.wisc.edu
    Jonathan Sorenson, Butler University sorenson@butler.edu

    • 1:30 p.m.
      Some Recent Results on Probable Prime Testing.
      Siguna M. Mueller*, University of Klagenfurt
      (969-11-215)
    • 2:00 p.m.
      Definite quadratic forms over $\Bbb F_q[x]$.
      Larry J Gerstein*, University of California, Santa Barbara
      (969-11-107)
    • 2:30 p.m.
      On fixed points for discrete logarithms.
      Mariana Campbell, University of California, Berkeley
      Carl Pomerance*, Bell Laboratories
      (969-11-179)
    • 3:00 p.m.
      Break
    • 3:30 p.m.
      Virtual logarithms.
      Oliver A Schirokauer*, Oberlin College
      (969-11-213)
    • 4:00 p.m.
      On group order distributions for abelian varieties of low dimension.
      Annegret Weng*, Institut fuer Experimentelle Mathematik
      (969-11-193)
    • 4:30 p.m.
      Products of like-indexed terms in two binary recurrences.
      Florian Luca, Unidad Morelia
      Gary Walsh*, University of Ottawa
      (969-11-44)
    • 5:00 p.m.
      Construction of elliptic curves over finite fields with known number of points.
      Amod Agashe, University of Texas, Austin
      Kristin E. Lauter*, Microsoft Research
      Ramarathnam Venkatesan, Microsoft Research
      (969-11-232)
  • Saturday September 22, 2001, 8:30 a.m.-11:20 a.m.
    Special Session on Cryptography and Computational and Algorithmic Number Theory, II

    UH 0047, University Hall (UH)
    Organizers:
    Eric Bach, University of Wisconsin-Madison bach@cs.wisc.edu
    Jonathan Sorenson, Butler University sorenson@butler.edu

    • 8:30 a.m.
      Some Computational Results Concerning Yokoi's Conjecture.
      Jozsef Beck, Rutgers University
      Edlyn Teske, University of Waterloo
      Hugh C Williams*, University of Calgary
      (969-11-182)
    • 9:00 a.m.
      Conditional and Unconditional Fundamental Unit Computation in Real Quadratic Fields.
      Michael J. Jacobson, Jr.*, University of Manitoba
      Hugh C. Williams, University of Calgary
      (969-11-181)
    • 9:30 a.m.
      Recent results on the computation of zeta values at negative integers.
      Joshua R Holden*, Rose-Hulman Institute of Technology
      (969-11-168)
    • 10:00 a.m.
      Break
    • 10:30 a.m.
      Unit Computation in Purely Cubic Function Fields.
      Yoonjin Lee, University of Delaware
      Renate Scheidler*, University of Calgary
      (969-11-167)
    • 11:00 a.m.
      On the iteration of certain quadratic maps over $GF(p)$.
      Troy MJ Vasiga*, University of Waterloo
      Jeffrey O Shallit, University of Waterloo
      (969-11-74)
  • Saturday September 22, 2001, 3:00 p.m.-4:50 p.m.
    Special Session on Cryptography and Computational and Algorithmic Number Theory, III

    UH 0047, University Hall (UH)
    Organizers:
    Eric Bach, University of Wisconsin-Madison bach@cs.wisc.edu
    Jonathan Sorenson, Butler University sorenson@butler.edu

    • 3:00 p.m.
      Ranks of quadratic twists of elliptic curves.
      Alice Silverberg*, Ohio State University
      (969-11-203)
    • 3:30 p.m.
      Solving elliptic curve discrete logarithm problems using Weil descent.
      Michael J Jacobson, University of Manitoba
      Alfred J Menezes, University of Waterloo
      Andreas Stein*, University of Illinois at Urbana-Champaign
      (969-94-187)
    • 4:00 p.m.
      Elliptic curve cryptography: the case of NIST P-224.
      Daniel J. Bernstein*, University of Illinois at Chicago
      (969-11-148)
    • 4:30 p.m.
      Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Compostite Degree.
      Markus Maurer, University of Waterloo
      Alfred J Menezes, Certicom Research & University of Waterloo
      Edlyn E Teske*, University of Waterloo
      (969-11-115)
  • Sunday September 23, 2001, 9:00 a.m.-11:50 a.m.
    Special Session on Cryptography and Computational and Algorithmic Number Theory, IV

    UH 0047, University Hall (UH)
    Organizers:
    Eric Bach, University of Wisconsin-Madison bach@cs.wisc.edu
    Jonathan Sorenson, Butler University sorenson@butler.edu

    • 9:00 a.m.
      Computations Related to Catalan's Conjecture.
      Jon Grantham*, IDA/CCS
      Ferrell Wheeler, IDA/CCS
      (969-11-217)
    • 9:30 a.m.
      Use of homomorphisms in cryptosystems.
      Jee H Koh*, Indiana University
      (969-11-139)
    • 10:00 a.m.
      Break
    • 10:30 a.m.
      Local Zeta functions, Trees and One-Way Functions.
      W. A. Zuniga-Galindo*, Barry University, Department of Mathematics and Computer Science
      (969-11-46)
    • 11:00 a.m.
      Is there a shortage of primes for cryptography?
      Samuel S Wagstaff*, Purdue University
      (969-11-73)
    • 11:30 a.m.
      Discussion
Inquiries:  meet@ams.org


Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia