There is a close relationship between encryption and randomness. The security of encryption algorithms usually depends on the random choice of keys and bit sequences. A famous example is Shannon’s result. Ciphers with perfect secrecy require randomly chosen key strings that are of the same length as the encrypted message. In Chapter 9, we will study the classical Shannon approach to provable security, together with more recent notions of security. One main problem is that truly random bit sequences of sufficient length are not available in most practical situations. Therefore, one works with pseudorandom bit sequences. They appear to be random, but actually they are generated by an algorithm.
Swipe to navigate through the chapters of this book
Please log in to get access to this content
To get access to this content you need the following product:
- One-Way Functions and Pseudorandomness
- Springer Berlin Heidelberg
- Sequence number
- Chapter number