Pseudorandomness and Random Number Generation
P vs. NP Problem
BPP Complexity Class
Relevance to Pseudorandomness
Derandomization
Integer Factorization
Discrete Logarithm Problem
Subset Sum Problem
Definition and Importance
Extracting Hard Bits
Goldreich-Levin Theorem
Formal Definition
Security Notions
Construction from One-Way Permutations
Seed Expansion
Computational Indistinguishability
Definition and Properties
Distinguishing from Random Functions
GGM Construction
Strong PRPs
Luby-Rackoff Construction
Feistel Networks
Applications in Block Ciphers
Previous
4. Cryptographically Secure Pseudorandom Number Generators
Go to top
Next
6. Applications of Random Number Generation