|
|
|
|
| LEADER |
02367nmm a2200337 u 4500 |
| 001 |
EB000652342 |
| 003 |
EBX01000000000000000505424 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540259428
|
| 100 |
1 |
|
|a Neuenschwander, Daniel
|
| 245 |
0 |
0 |
|a Probabilistic and Statistical Methods in Cryptology
|h Elektronische Ressource
|b An Introduction by Selected Topics
|c by Daniel Neuenschwander
|
| 250 |
|
|
|a 1st ed. 2004
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2004, 2004
|
| 300 |
|
|
|a X, 162 p
|b online resource
|
| 505 |
0 |
|
|a 1 Classical Polyalphabetic Substitution Ciphers -- 2 RSA and Probabilistic Prime Number Tests -- 3 Factorization with Quantum Computers: Shor’s Algorithm -- 4 Physical Random-Number Generators -- 5 Pseudo-random Number Generators -- 6 An Information Theory Primer -- 7 Tests for (Pseudo-)Random Number Generators -- 8 Diffie-Hellman Key Exchange -- 9 Differential Cryptanalysis -- 10 Semantic Security -- 11 *Algorithmic Complexity -- 12 Birthday Paradox and Meet-in-the-Middle Attack -- 13 Quantum Cryptography
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Cryptography
|
| 653 |
|
|
|a Probability Theory
|
| 653 |
|
|
|a Data encryption (Computer science)
|
| 653 |
|
|
|a Cryptology
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Probabilities
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/b97045
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b97045?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a 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
|