Contemporary Methods in Cryptography

January 9 - 13, 2002


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.

Organizing Committee

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