Cryptography

Theory and Practice

Douglas Stinson

340 pages, parution le 26/03/2002 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

Represents a major revision and updating of the bestselling first edition
Includes a new chapter on block ciphers and the new advanced encryption standard (AES) and another on the applications of secret sharing schemes
Adds new material on elliptic curve DSA and the Random Oracle Model, generic algorithms for the discrete logarithm problem, and the Dillard rho algorithm
Serves as an outstanding text for a first course in cryptography for students of computer science and mathematics

The Advanced Encryption Standard (AES), elliptic curve DSA, the secure hash algorithm...these and other major advances over that last five years demanded this comprehensive revision of the standard-setting text and reference, Cryptography: Theory and Practice. Now more tightly focused on the core areas, it contains many new topics as well as thoroughly updated treatments of topics presented in the first edition. There is increased emphasis on general concepts, but the outstanding features that first made this a bestseller all remain, including its mathematical rigor, numerous examples, pseudocode descriptions of algorithms, and clear, precise explanations.

New in the Second Edition:

Explains the latest Federal Information Processing Standards , including the Advanced Encryption Standard (AES), the Secure Has Algorithm (SHA-1), and the Elliptic Curve Digital Signature Algorithm (ECDSA)
Uses substitution-permutation networks to introduce block cipher design and analysis concepts
Explains both linear and differential cryptanalysis
Presents the Random Oracle model for hash functions
Addresses semantic security of RSA and Optional Asymmetric Encryption Padding
Discusses Wiener's attach on low decryption exponent RSA

Overwhelmingly popular and relied upon in its first edition, now, more than ever, Cryptography: Theory and Practice provides an introduction to the field ideal for upper-level students in both mathematics and computer science.

More highlights of the Second Edition:

Provably secure signature schemes: Full Domain Hash
Universal hash families
Expanded treatment of message authentication codes
More discussions on elliptic curves
Lower bounds for the complexity of generic algorithms for the discrete logarithm problem
Expanded treatment of factoring algorithms
Security definitions for signature schemes

Contents

Classical Cryptography
Shannon's Theory
Block Ciphers and the Advanced Encryption Standard
Cryptographic Hash Functions
The RSA Cryptosystem and Factoring Integers
Public-Key Cryptography Based on the Discrete Logarithm Problem
Signature Schemes

Bibliography
Cryptosystem Index
Algorithms Index
Problem Index
Subject Index

L'auteur - Douglas Stinson

Douglas Stinson, docteur en informatique de l'université de Waterloo, est professeur au département d'informatique et d'ingénierie de l'université de Nebraska-Lincoln. Il est l'éditeur en chef du journal of Combinatorial Designs et est également membre du comité éditorial de quatre autres journaux. Il a publié de nombreux articles dans le domaine de la cryptologie, la combinatoire et l'informatique théorique. Il a obtenu en 1994 la médaille Hall de l'Institute of Combinatorics and Its Applications.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Chapman and Hall / CRC
Auteur(s)	Douglas Stinson
Parution	26/03/2002
Édition	2^eme édition
Nb. de pages	340
Format	16 x 24
Couverture	Relié
Poids	676g
Intérieur	Noir et Blanc
EAN13	9781584882060