Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes)
Pseudorandomness and Cryptographic Applications, by Michael Luby, presents the mathematical underpinnings of one-way hash functions, which can be used to implement pseudorandom number generators. (These have a wide array of applications in cryptography.) After covering these basic mathematical ideas, the author delves into their applications in cryptosystems. Organized in 18 lectures, this book provides a mathematically intense treatise on the subject without much commentary in between. A set of exercises accompanies each chapter and a bibliography concludes the text. Filled with elegant mathematics, this is clearly a book for academic specialists.