Skip to main content

David Zuckerman

Doing the Math for Better Encryption

Pile of different colored and shaped dice.

05/02/2017 - From SIGNAL Magazine: A breakthrough formula for generating random numbers may be the key to cybersecurity. They do not necessarily match the hero stereotype, but computer scientists improving methods of generating random numbers just may save the day when it comes to cybersecurity.

New Method of Producing Random Numbers Could Improve Cybersecurity

05/16/2016 - With an advance that one cryptography expert called a "masterpiece," University of Texas at Austin computer scientists have developed a new method for producing truly random numbers, a breakthrough that could be used to encrypt data, make electronic voting more secure, conduct statistically significant polls and more accurately simulate complex systems such as Earth's climate.

David Zuckerman's award from the Simons Foundation

04/15/2016 - David Zuckerman has been selected as a Simons Investigator in Theoretical Computer Science. David's research focuses primarily on pseudorandomness and the role of randomness in computing. He is best known for his work on randomness extractors and their applications. His other research interests include coding theory, distributed computing, cryptography, inapproximability, and other areas of complexity theory.

David Zuckerman Elected ACM Fellow

12/10/2013 - Professor David Zuckerman has been elected to be an ACM Fellow for his contributions to randomness extraction, pseudo randomness, and their role in complexity theory.

Fall 2004 Visions Lecture a success

11/08/2004 - On November 8, 2004 Department of Computer Sciences (UTCS) faculty, graduate students, FoCS members and other guests attended the Fall 2004 Visions of Computer Sciences Lectures.