AMS International Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:21:42
Joint AMS-SMM International Meeting
Houston, TX, May 13-15, 2004
Meeting #998
Associate secretaries: John L Bryant, AMS bryant@math.fsu.edu
Special Session on Coding Theory and Cryptography
-
Thursday May 13, 2004, 8:30 a.m.-11:20 a.m.
Special Session on Coding Theory and Cryptography, I
Organizers:
Horacio Tapia-Recillas, UAM-Iztapalapa htr@xanum.uam.mx
Neal I. Koblitz, University of Washington koblitz@math.washington.edu
-
8:30 a.m.
Improvement of Ax-Katz's, Moreno-Moreno's and Wan's Results.
Oscar Moreno*, University of Puerto Rico
Francis N Castro, University of Puerto Rico
(998-11-50) -
9:00 a.m.
Inference Control.
Jessica N Staddon*, Palo Alto Research Center
(998-68-34) -
9:30 a.m.
Formulae for the number of polynomials over a finite field satisfying given requirements.
Joseph L Yucas*, Southern Illinois University
(998-11-32) -
10:00 a.m.
Recent results related to value sets of polynomials over finite fields.
Pinaki Das*, Penn State Altoona
(998-11-45) -
10:30 a.m.
Custom Elliptic Curves for Fast Public-Key Cryptography.
Jerome A Solinas*, National Security Agency
(998-11-381) -
11:00 a.m.
LDPC Codes and Their Constructions.
Jon-Lark Kim*, University of Nebraska - Lincoln
(998-94-22)
-
8:30 a.m.
-
Thursday May 13, 2004, 2:00 p.m.-3:50 p.m.
Special Session on Coding Theory and Cryptography, II
Organizers:
Horacio Tapia-Recillas, UAM-Iztapalapa htr@xanum.uam.mx
Neal I. Koblitz, University of Washington koblitz@math.washington.edu
-
2:00 p.m.
Computing discrete logarithms in finite fields.
Oliver A Schirokauer*, Oberlin College
(998-11-400) -
2:30 p.m.
On the equivalence of codes over finite rings and modules.
Hai Quang Dinh, North Dakota State University
Sergio R. Lopez-Permouth*, Ohio University
(998-94-158) -
3:00 p.m.
Discussion -
3:30 p.m.
Efficient Instantiations of Tweakable Blockciphers.
Phillip Rogaway*, UC Davis
(998-68-428)
-
2:00 p.m.
-
Friday May 14, 2004, 8:30 a.m.-11:20 a.m.
Special Session on Coding Theory and Cryptography, III
Organizers:
Horacio Tapia-Recillas, UAM-Iztapalapa htr@xanum.uam.mx
Neal I. Koblitz, University of Washington koblitz@math.washington.edu
-
8:30 a.m.
Minimum distance bounds for divisible codes.
Iwan Duursma*, University of Illinois at Urbana-Champaign
(998-94-64) -
9:00 a.m.
How to find smooth parts of integers.
Daniel J. Bernstein*, University of Illinois at Chicago
(998-11-98) -
9:30 a.m.
Construction of Linear Codes via Grobner bases.
Shuhong Gao*, Clemson University
(998-94-43) -
10:30 a.m.
Correlation Among Signal Sets.
Guang Gong*, University of Waterloo
(998-94-51) -
11:00 a.m.
An Essay on Equivalence of Linear Codes, III.
Jay A Wood*, Western Michigan University
(998-94-277)
-
8:30 a.m.
-
Saturday May 15, 2004, 8:30 a.m.-11:20 a.m.
Special Session on Coding Theory and Cryptography, IV
Organizers:
Horacio Tapia-Recillas, UAM-Iztapalapa htr@xanum.uam.mx
Neal I. Koblitz, University of Washington koblitz@math.washington.edu
-
8:30 a.m.
Key escrow with elliptic curves.
Edlyn E Teske*, University of Waterloo
(998-94-23) -
9:00 a.m.
Interleavers for Turbo Codes Constructed Using Dickson Polynomials.
Ivelisse M Rubio*, University of Puerto Rico
Carlos J. Corrada-Bravo, University of Puerto Rico
(998-94-59) -
9:30 a.m.
Structure and minimum Hamming weight of negacyclic codes over Galois rings.
Hai Quang Dinh*, North Dakota State University
(998-94-323) -
10:00 a.m.
A Key Recovery System as Secure as Factoring.
Adam L Young*, Cigital, Inc.
Moti M Yung, Columbia University
(998-68-44) -
10:30 a.m.
Repeated-root $p$-cyclic codes.
Horacio Tapia-Recillas*, UAM-I
(998-94-214) -
11:00 a.m.
Self-Dual Binary Codes of Length 104 and Minimum Distance 18.
Vassil Y Yorgov*, Fayetteville State University
(998-05-54)
-
8:30 a.m.