ACAC Seminar Abstract

ACAC Seminar Abstract

ACAC Seminars

ACAC Seminar Abstract

Pseudorandom Number Generators: Applications, Properties and Classes

Speaker: Domingo Gomez
Date, Time: Fri, 24 Feb 2012 10:20

Random numbers are used in cryptography in almost all protocols, i. e. anonymous speech, authentication over an insecure channel, key agreement, etc. All of these protocols are secure under the condition that this information should be ``unpredictable''. Unfortunately true random numbers are hard to generate, mainly because the deterministic nature of a computer. Pseudorandom number generators are algorithms to generate sequences that simulate the behaviour of sequences of true random numbers. They are deterministic and for many measures they assure a level of quality that the random number sequences posses with certain degree of confidence.

In this talk, we motivate the use of random number in cryptography and then we review several pseudorandom number generators. Then, we introduce some measures to evaluate the predictability of a sequence and give the corresponding values of these measures for the most studied pseudorandom number generators.

Back to the top of this page