Cryptography: Theory and Practice, Third Edition (Discrete Mathematics and Its Applications)

Stinson, Douglas R.

ISBN 10: 1584882069 / ISBN 13: 9781584882060

Editore: Chapman and Hall/CRC, 2002

Riguardo questo articolo

Orders shipped daily from the UK. Professional seller.

Codice articolo mon0000480103

Dati bibliografici

• Titolo: Cryptography: Theory and Practice, Third Edition (Discrete Mathematics and Its Applications)
• Editore: Chapman and Hall/CRC
• Data di pubblicazione: 2002
• Lingua: Inglese
• ISBN 10: 1584882069
• ISBN 13: 9781584882060
• Rilegatura: hardcover
• Edizione: seconda edizione
• Condizione: Acceptable

Descrizione articolo

Riassunto

The Advanced Encryption Standard (AES), elliptic curve DSA, the secure hash algorithm…these and other major advances made in recent years precipitated 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 additional 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.

Highlights of the Second Edition:

Explains the latest Federal Information Processing Standards, including the Advanced Encryption Standard (AES), the Secure Hash 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 attack 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

Informazioni sull?autore

Douglas R Stinson is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo, Ontario, Canada.