Cryptology nowadays is one of the most important areas of applied mathematics, building on deep results and methods from various areas of mathematics. This text is devoted to the study of stochastic aspects of cryptology.
Besides classical topics from cryptology, the author presents chapters on probabilistic prime number tests, factorization with quantum computers, random-number generators, pseudo-random-number generators, information theory, and the birthday paradox and meet-in-the-middle attack.
In the light of the vast literature on stochastic results relevant for cryptology, this book is intended as an invitation and introduction for students, researchers, and practitioners to probabilistic and statistical issues in cryptology.
Author(s): Daniel Neuenschwander (auth.)
Series: Lecture Notes in Computer Science 3028
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2004
Language: English
Pages: 162
City: Berlin; New York
Tags: Data Encryption
Front Matter....Pages -
Introduction....Pages 1-7
1 Classical Polyalphabetic Substitution Ciphers....Pages 9-15
2 RSA and Probabilistic Prime Number Tests....Pages 17-35
3 Factorization with Quantum Computers: Shor’s Algorithm....Pages 37-45
4 Physical Random-Number Generators....Pages 47-55
5 Pseudo-random Number Generators....Pages 57-75
6 An Information Theory Primer....Pages 77-88
7 Tests for (Pseudo-)Random Number Generators....Pages 89-105
8 Diffie-Hellman Key Exchange....Pages 107-113
9 Differential Cryptanalysis....Pages 115-123
10 Semantic Security....Pages 125-133
11 *Algorithmic Complexity....Pages 135-138
12 Birthday Paradox and Meet-in-the-Middle Attack....Pages 139-144
13 Quantum Cryptography....Pages 145-146
Back Matter....Pages -
