Cryptography, secret writing, is enjoying a scientific renaissance following the seminal discovery in 1977 of public-key cryptography and applications in computers and communications. This book gives a broad overview of public-key cryptography - its essence and advantages, various public-key cryptosystems, and protocols - as well as a comprehensive introduction to classical cryptography and cryptoanalysis. The second edition has been revised and enlarged especially in its treatment of cryptographic protocols. From a review of the first edition: "This is a comprehensive review ... there can be no doubt that this will be accepted as a standard text. At the same time, it is clearly and entertainingly written ... and can certainly stand alone." Alex M. Andrew, Kybernetes, March 1992
Author(s): Arto Salomaa
Series: Texts in Theoretical Computer Science. An EATCS Series
Edition: 2nd
Publisher: Springer
Year: 1996
Language: English
Commentary: low quality (300 dpi) and no cover
Pages: 279
Public-Key Cryptography......Page 1
Preface to the Second, Enlarged Edition......Page 5
Preface to the First Edition......Page 6
Contents......Page 7
1.1 Cryptosystems and Cryptanalysis......Page 9
1.2 Monoalphabetic Systems......Page 18
1.3 Polyalphabetic and Other Systems......Page 30
1.4 Rotors and DES......Page 47
2.1 Some Streets Are One-way......Page 63
2.2 How to Realize the Idea......Page 72
2.3 Obvious Advantages of Public Keys......Page 79
3.1 A Trapdoor is Built......Page 85
3.2 How to Find the Trapdoor......Page 95
3.3 Theory of Reachability......Page 104
3.4 Trying to Hide the Trapdoor Again......Page 116
3.5 Dense Knapsacks......Page 125
4.1 Legal World......Page 133
4.2 Attack and Defense......Page 142
4.3 Primality......Page 145
4.4 Cryptanalysis and Factoring......Page 151
4.5 Partial Information on RSA......Page 155
4.6 Discrete Logarithms and Key Exchange......Page 162
5.1 Exponentiation in Quadratic Fields......Page 167
5.2 Iteration of Morphisms......Page 174
5.3 Automata and Language Theory......Page 182
5.4 Coding Theory......Page 186
6.1 More than Etiquette......Page 189
6.2 Coin Flipping by Telephone. Poker Revisited......Page 192
6.3 How to Share a Secret......Page 195
6.4 Partial Disclosure of Secrets......Page 198
6.5 Oblivious Transfer......Page 202
6.6 Applications: Banking and Ballots......Page 208
6.7 Convincing Proofs with No Details......Page 210
6.8 Zero-Knowledge Proofs......Page 216
6.9 Zero-Knowledge Proofs of Identity......Page 221
6.10 Secret Balloting Systems Revisited......Page 226
6.11 Cryptographic Protocols Without Computers......Page 242
Appendix A. Tutorial in Complexity Theory......Page 253
Appendix B. Tutorial in Number Theory......Page 257
Problems......Page 263
