Cryptographically secure Pseudorandom Number Generators
| Thesis title in Czech: | Kryptograficky bezpečné generátory pseudonáhodných čísel |
|---|---|
| Thesis title in English: | Cryptographically secure Pseudorandom Number Generators |
| Key words: | Kryptograficky bezpečné generátory pseudonáhodných|Generátory pseudonáhodných čísel (PRNG)|Algoritmus Yarrow|Algoritmus Fortuna|Kryptografické útoky|Akumulace entropie|Proudová šifra |
| English key words: | Cryptographically Secure Random Number Generators|Pseudorandom Number Generators (PRNG)|Yarrow Algorithm|Fortuna Algorithm|Cryptographic Attacks|Entropy Accumulation|Stream Cipher} |
| Academic year of topic announcement: | 2023/2024 |
| Thesis type: | diploma thesis |
| Thesis language: | angličtina |
| Department: | Department of Algebra (32-KA) |
| Supervisor: | doc. Faruk Göloglu, Dr. rer. nat. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 05.05.2023 |
| Date of assignment: | 14.06.2023 |
| Confirmed by Study dept. on: | 30.06.2023 |
| Date and time of defence: | 06.09.2024 08:30 |
| Date of electronic submission: | 17.07.2024 |
| Date of submission of printed version: | 17.07.2024 |
| Date of proceeded defence: | 06.09.2024 |
| Opponents: | Mgr. Pavel Hubáček, Ph.D. |
| Guidelines |
| The aim of the thesis is a survey and a study on PRNGs (Pseudorandom Number Generators) and their
cryptographic aspects. The student should present the background and theory using several sources [2,3]. The thesis should also give an overview of PRNGs used in practice (Windows OS, Python language libraries, Linux/UNIX OS, etc.), and explain in detail some cryptographic attacks against PRNGs and systems that use PRNGs [1,4]. Real applications of attacks (e.g., computer programs) could be a part of this thesis. To receive the best grade, the student should give improvements of existing attacks. |
| References |
| [1] Leo Dorrendorf, Zvi Gutterman, and Benny Pinkas; Cryptanalysis of the random number generator of the Windows operating system, ACM Transactions on Information and System Security, Volume 13, Issue 1, Article No.: 10, pp 1–32, 2009.
[2] Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby: A Pseudorandom Generator from any One-way Function. SIAM J. Comput. 28(4): 1364-1396 (1999) [3] Michael Luby: Pseudorandomness and cryptographic applications. Princeton computer science notes, Princeton University Press 1996, ISBN 978-0-691-02546-9, pp. I-XVI, 1-234 [4] John Kelsey, Bruce Schneier, David A. Wagner, Chris Hall: Cryptanalytic Attacks on Pseudorandom Number Generators. FSE 1998: 168-188 |