Workshop

This workshop will focus on number-theoretic aspects of cryptography, and will be cross-cultural, where the the cultures in question are "mathematics" and "computer science." We will be sufficiently flexible to accommodate anything exciting that arises through the fall of 2000, so any plans are tentative. We will have several survey talks on the state of the art of such central topics to number theory in cryptography as integer factorization discrete logarithm algorithms elliptic curves From the computer science side, we will survey positive applications of lattices to cryptography lattice basis reduction techniques for cryptanalysis "new" number-theoretic assumptions in vogue in 2000 A final survey talk will discuss two historical tracks that met in 1998: practical cryptosystems (RSA, El-Gamal, OAEP, and Cramer-Shoup), and the theory that lead to increasingly stronger notions of security and cryptosystems satisfying these notions (Goldwasser and Micali's construction for semantic security, Naor and Yung's construction for chosen-ciphertext security in the pre-processing mode, Dolev, Dwork and Naor's construction for non-malleability against chosen-ciphertext in the post-processing mode, and Cramer-Shoup's efficient non-malleable cca-post construction).