Notice bibliographique
- Notice
Type(s) de contenu et mode(s) de consultation : Texte noté. Image fixe : sans médiation
Auteur(s) : Blahut, Richard E. (1937-....)
Titre(s) : Cryptography and secure communication [Texte imprimé] / Richard E. Blahut
Publication : Cambridge : Cambridge university press, 2014
Description matérielle : 1 vol. (XVII-587 p.) : ill. ; 26 cm
Comprend : Machine generated contents note: 1.Introduction ; 1.1.Classical cryptography ;
1.2.Notions of cryptographic secrecy ; 1.3.Block ciphers ; 1.4.Stream ciphers ;
1.5.Public-key cryptography ; 1.6.Iterated and cascade ciphers ; 1.7.Cryptanalysis
; 1.8.Implementation attacks ; 1.9.Complexity theory ; 1.10.Authentication and identification
; 1.11.Ownership protection ; 1.12.Covert communications ; 1.13.History of information
protection ; 2.The integers ; 2.1.Basic number theory ; 2.2.The euclidean algorithm
; 2.3.Prime fields ; 2.4.Quadratic residues ; 2.5.Quadratic reciprocity ; 2.6.The
Jacobi symbol ; 2.7.Primality testing ; 2.8.The Fermat algorithm ; 2.9.The Solovay
; trassen algorithm ; 2.10.The Miller ; abin algorithm ; 2.11.Factoring of integers
; 2.12.The Pollard algorithm for factoring ; 2.13.Square roots in a prime field
; 3.Cryptography based on the integer ring ; 3.1.Biprime cryptography ; 3.2.Implementing
biprime cryptography ;
Contents note continued: 3.3.Protocol attacks on biprime cryptography ; 3.4.Direct
attacks on biprime encryption ; 3.5.Factoring biprimes ; 3.6.The quadratic sieve
; 3.7.The number-field sieve ; 3.8.The Rabin cryptosystem ; 3.9.The rise and fall
of knapsack cryptosystems ; 4.Cryptography based on the discrete logarithm ; 4.1.Diffie
; ellman key exchange ; 4.2.Discrete logarithms ; 4.3.The Elgamal cryptosystem
; 4.4.Trapdoor one-way functions ; 4.5.The Massey ; mura cryptosystem ; 4.6.The
Pohlig ; ellman algorithm ; 4.7.The Shanks algorithm ; 4.8.The Pollard algorithm
for discrete logarithms ; 4.9.The method of index calculus ; 4.10.Complexity of
the discrete-log problem ; 5.Information-theoretic methods in cryptography ; 5.1.Probability
space ; 5.2.Entropy ; 5.3.Perfect secrecy ; 5.4.The Shannon ; cMillan theorem
; 5.5.Unicity distance ; 5.6.Entropy of natural language ; 5.7.Entropy expansion
; 5.8.Data compaction ; 5.9.The wiretap channel ;
Contents note continued: 6.Block ciphers ; 6.1.Block substitution ; 6.2.The Feistel
network ; 6.3.The Data Encryption Standard ; 6.4.Using the Data Encryption Standard
; 6.5.Double and triple DES encryption ; 6.6.The Advanced Encryption Standard ;
6.7.Differential cryptanalysis ; 6.8.Linear cryptanalysis ; 7.Stream ciphers ;
7.1.State-dependent encryption ; 7.2.Additive stream ciphers ; 7.3.Linear shift-register
sequences ; 7.4.The linear-complexity attack ; 7.5.Analysis of linear complexity
; 7.6.Keystreams from nonlinear feedback ; 7.7.Keystreams from nonlinear combining
; 7.8.Keystreams from nonlinear functions ; 7.9.The correlation attack ; 7.10.Pseudorandom
sequences ; 7.11.Nonlinear sets of sequences ; 8.Authentication and ownership protection
; 8.1.Authentication ; 8.2.Identification ; 8.3.Authentication signatures ; 8.4.Hash
functions ; 8.5.The birthday attack ; 8.6.Iterated hash constructions ; 8.7.Formal
hash functions ;
Note(s) : Bibliogr. p. 558-575
Sujet(s) : Cryptographie
Indice(s) Dewey :
005.824 (23e éd.) = Chiffrement des données (informatique)
Identifiants, prix et caractéristiques : ISBN 9781107014275. - ISBN 1107014271 (rel.)
Identifiant de la notice : ark:/12148/cb43850719n
Notice n° :
FRBNF43850719
(notice reprise d'un réservoir extérieur)
