Probabilistic and Statistical Methods in Cryptology

An Introduction by Selected Topics

Daniel Neuenschwander - Collection Lecture Notes in Computer Science

160 pages, parution le 05/08/2004

Ajouter à une liste

Indisponible

Résumé

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.

Written for:
Advances students, researchers and professionals

Sommaire

Classical Polyalphabetic Substitution Ciphers
RSA and Probabilistic Prime Number Tests
Factorization with Quantum Computers: Shor'sAlgorithm
Physical Random-Number Generators
Pseudo-random Number Generators
An Information Theory Primer
Tests for (Pseudo-)Random Number Generators
Diffie-Hellman Key Exchange
Differential Cryptanalysis
Algorithmic Complexity
Birthday Paradox and Meet-in-the-Middle Attack
Quantum Cryptography

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Daniel Neuenschwander
Collection	Lecture Notes in Computer Science
Parution	05/08/2004
Nb. de pages	160
Format	15,5 x 23,5
Couverture	Broché
Poids	275g
Intérieur	Noir et Blanc
EAN13	9783540220015