Contemporary Methods in Cryptography

January 9 - 13, 2002

Schedule and Presentations

Pictures

Organizing Committee

Don Blasius (UCLA)
William Duke (UCLA)
Jon Rogawski (UCLA)

Scientific Committee

Dan Boneh (Stanford University)
Cynthia Dwork (Microsoft Research)
Joseph Silverman (Brown University)

Introduction

The need to securely transmit ever-increasing quantities of data over the internet has given rise to a new set of problems and solutions which lie on the interface between number theory, complexity theory, and computer science. This has led to active collaborations between academic researchers and their counterparts in the industry. This program will present recent advances in the science of cryptography. Emphasis will be on the mathematical aspects of the field as opposed to dealing with the practical implementation of secure communications networks. Topics of interest include: public key cryptography and attacks on them (factorization, discrete logs, elliptic curves, lattices, non-abelian groups), pseudo-random number generators, hash functions, symmetric ciphers, DES, AES/Rijndael, provable cryptographic constructions, digital signatures, and lattice basis reduction cryptosystems.

Speakers

Contact Us:

Institute for Pure and Applied Mathematics (IPAM)
Attn: CRY2002
460 Portola Plaza
Los Angeles CA 90095-7121
Phone: 310 825-4755
Fax: 310 825-4756
Email: ipam@ucla.edu
Website: http://www.ipam.ucla.edu/programs/cry2002/