000 | 03186nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-25942-8 | ||
003 | DE-He213 | ||
005 | 20240423125636.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2004 gw | s |||| 0|eng d | ||
020 |
_a9783540259428 _9978-3-540-25942-8 |
||
024 | 7 |
_a10.1007/b97045 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
100 | 1 |
_aNeuenschwander, Daniel. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aProbabilistic and Statistical Methods in Cryptology _h[electronic resource] : _bAn Introduction by Selected Topics / _cby Daniel Neuenschwander. |
250 | _a1st ed. 2004. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2004. |
|
300 |
_aX, 162 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3028 |
|
505 | 0 | _a1 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. | |
520 | _aCryptology 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aCryptography. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 0 | _aProbabilities. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aCryptology. |
650 | 2 | 4 | _aProbability Theory. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540220015 |
776 | 0 | 8 |
_iPrinted edition: _z9783662203309 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3028 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b97045 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c180184 _d180184 |