Overview
THE LEGACY…
First introduced in 1995, Cryptography: Theory and Practice garnered enormous praise and popularity, and soon became the standard textbook for cryptography courses around the world. The second edition was equally embraced, and enjoys status as a perennial bestseller. Now in its third edition, this authoritative text continues to provide a solid foundation for future breakthroughs in cryptography.
WHY A THIRD EDITION?
The art and science of cryptography has been evolving for thousands of years. Now, with unprecedented amounts of information circling the globe, we must be prepared to face new threats and employ new encryption schemes on an ongoing basis. This edition updates relevant chapters with the latest advances and includes seven additional chapters covering:
- Pseudorandom bit generation in cryptography
- Entity authentication, including schemes built from primitives and special purpose "zero-knowledge" schemes
- Key establishment including key distribution and protocols for key agreement, both with a greater emphasis on security models and proofs
- Public key infrastructure, including identity-based cryptography
- Secret sharing schemes
- Multicast security, including broadcast encryption and copyright protection
THE RESULT…
Providing mathematical background in a "just-in-time" fashion, informal descriptions of cryptosystems along with more precise pseudocode, and a host of numerical examples and exercises, Cryptography: Theory and Practice, Third Edition offers comprehensive, in-depth treatment of the methods and protocols that are vital to safeguarding the mind-boggling amount of information circulating around the world.
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 ofgeneric algorithms for the discrete logarithm problem·Expanded treatment of factoring algorithms·Security definitions for signature schemes
Synopsis
THE LEGACY…
First introduced in 1995, Cryptography: Theory and Practice garnered enormous praise and popularity, and soon became the standard textbook for cryptography courses around the world. The second edition was equally embraced, and enjoys status as a perennial bestseller. Now in its third edition, this authoritative text continues to provide a solid foundation for future breakthroughs in cryptography.
WHY A THIRD EDITION?
The art and science of cryptography has been evolving for thousands of years. Now, with unprecedented amounts of information circling the globe, we must be prepared to face new threats and employ new encryption schemes on an ongoing basis. This edition updates relevant chapters with the latest advances and includes seven additional chapters covering:
THE RESULT…
Providing mathematical background in a "just-in-time" fashion, informal descriptions of cryptosystems along with more precise pseudocode, and a host of numerical examples and exercises, Cryptography: Theory and Practice, Third Edition offers comprehensive, in-depth treatment of the methods and protocols that are vital to safeguarding the mind-boggling amount of information circulating around the world.
Booknews
An expanded edition of an introductory text covering the core areas of cryptography. Author Stinson (combinatorics and optimization, U. of Waterloo, Ontario) assumes readers have a basic familiarity with linear algebra, number theory, probability, and information theory, and he writes that some familiarity with computation complexity, algorithms, and NP-completeness theory is helpful. Topics include "classical" cryptosystems, Shannon's approach to cryptography, modern block cipher design and analysis, keyed and unkeyed hash functions, the RSA Cryptosystem, public-key cryptosystems, and signature schemes. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Editorials
From the Publisher
"It is by far the most suitable text for undergraduate and graduate courses on the subject in mathematics and computer science departments. Besides having breadth and scope in the choice of topics, many of them are dealt with in much more depth than what can be found elsewhere at this level . . . If you really want to learn some cryptography this is probably the best available text."– Peter Shiu, Department of Mathematical Sciences, Loughborough University, in The Mathematical Gazette, March 2007
". . . the book is very well suited for a course in crypotography."
– Bran van Asch, in Mathematical Reviews, 2007f
An expanded edition of an introductory text covering the core areas of cryptography. Author Stinson (combinatorics and optimization, U. of Waterloo, Ontario) assumes readers have a basic familiarity with linear algebra, number theory, probability, and information theory, and he writes that some familiarity with computation complexity, algorithms, and NP-completeness theory is helpful. Topics include "classical" cryptosystems, Shannon's approach to cryptography, modern block cipher design and analysis, keyed and unkeyed hash functions, the RSA Cryptosystem, public-key cryptosystems, and signature schemes. Annotation c. Book News, Inc., Portland, OR (booknews.com)