On Finite Pseudorandom Binary Sequences and Their Applications in Cryptography

Andras Sarkozy
Eotvos University, Hungary

September 7, 2004
11 a.m. - 12 noon
Campus Center Odeum

Abstract

Finite pseudorandom binary sequences have many applications, the most important one in cryptography: in the modern applications of the standard encrypting algorithm called Vernam cipher one needs the application of pseudorandom bit sequences as keystreams. This leads to the question: when does a finite binary sequence form a "good" pseudorandom sequence? This question is usually answered by using complexity theory. However, this approach has several weaknesses to be discussed in the talk. To avoid these difficulties, in the last 10 years Sárközy and coauthors have developed a new, more constructive approach. This new approach will be outlined in the talk, and the best constructions and their basic properties will be described.

Biography

Andras Sarkozy is one of the most prominent number theorists in the world. He is a professor of the Eotvos University, Budapest, and he is the Head of the Algebra and Number Theory Department of the university. He is a regular member of the Hungarian Academy of Sciences, and he is the chairman of the Mathematical Committee of the Hungarian Academy. He has been a visiting professor or researcher in 5 countries for altogether 10 years, including nearly 5 years in the US. He has recently received an honorary doctorate from the Universite de la Mediterranee Marseille, France.

Andras Sarkozy has written over 200 research papers and 4 books. These are mostly in number theory, and recently he has also worked in computational number theory and cryptography. He has 40 coauthors from 8 countries. He was the number one coauthor of Paul Erdos, one of the leading mathematicians of the twentieth century; they wrote 62 joint papers. Andras Sarkozy has received 7 prestigious mathematical and scientific awards.

Host

Fernando C. Colon Osorio
Refreshments will be served.

Maintained by webmaster@wpi.edu
Last modified: Sep 27, 2006, 16:05 EDT