Workshop I: Number Theory and Cryptography – Open Problems

October 9 - 13, 2006


Cryptography depends on a continuing stream of new insights and methods from number theory, arithmetic algebraic geometry, and other branches of algebra. In the past, there have been important developments in primality testing, factoring large integers, lattice-based cryptography, sieve methods, elliptic curve cryptography, ECPP, torus-based cryptosystems, discrete log problems, Weil pairing, cyclicity of elliptic curves and hyperelliptic cryptosystems. The content of this workshop will be based on emerging developments and discussion of open problems posed by applications.

Organizing Committee

Don Blasius (UCLA, Mathematics)
Kristin Lauter (Microsoft Research)
Arjen Lenstra, Chair (École Polytechnique Fédérale de Lausanne (EPFL))
Alice Silverberg (University of California, Irvine, Mathematics and Computer Science)
Joseph Silverman (Brown University, Mathematics)