Learn the sad history of random bits

Posted by
On March 21, 2019

George MarkowskyDr. George Markowsky, professor of computer science, will present a lecture titled “The Sad History of Random Bits,” at 10 a.m. Monday, April 1, in Room 209 Computer Science Building.

The abstract of the lecture is as follows: In this talk, we examine the history of using random numbers in computer programs. Unfortunately, this history is sad because it is replete with disasters ranging from one of the first pseudo-random number generators, RANDU, being very bad to the most recent efforts by the NSA to undermine the pseudo-random number generator in RSA’s BSAFE cryptographic library. Failures in this area have been both intentional and unintentional, but unfortunately, the same sorts of mistakes are repeated. The repeated failures in getting our “random numbers” correct suggest that there might be some systemic reasons for these failures. In this talk, we review some of these failures in more detail and the 2006 Debian OpenSSL Debacle in great detail. This last event left users of Debian and its derivatives with seriously compromised cryptographic capabilities for two years. We also illustrate how this failure can be exploited in an attack and modify the concept of a system accident developed in the work of Charles Perrow. We identify some system failures in building pseudo-random number generators and offer some suggestions to help develop PRNGs and other code more securely.

Share this page

Posted by

On March 21, 2019. Posted in Announcements