Monday, 6.11. 13:30
Seminar room Altenbergerstrasse 50
Cryptanalysis of pseudorandom number generators.
Random is a word that appears very often in the real life. Probably, the most commonly encountered randomness requirement today is the user password which is usually a simple character string. The frequency and volume of the requirement for random quantities differs greatly for different cryptographic systems. For the present, the lack of generally available facilities for generating such unipredictable numbers is an open wound in the design of crytographic software.
In this talk, we study some possible solutions for generating random numbers in cryptography using number theory.