Cryptography and Network Security: Principles and Practice (7th Edition)
Format: PDF / Kindle (mobi) / ePub
The Principles and Practice of Cryptography and Network Security
Stallings’ Cryptography and Network Security, Seventh Edition, introduces the reader to the compelling and evolving field of cryptography and network security. In an age of viruses and hackers, electronic eavesdropping, and electronic fraud on a global scale, security is paramount. The purpose of this book is to provide a practical survey of both the principles and practice of cryptography and network security. In the first part of the book, the basic issues to be addressed by a network security capability are explored by providing a tutorial and survey of cryptography and network security technology. The latter part of the book deals with the practice of network security: practical applications that have been implemented and are in use to provide network security.
The Seventh Edition streamlines subject matter with new and updated material — including Sage, one of the most important features of the book. Sage is an open-source, multiplatform, freeware package that implements a very powerful, flexible, and easily learned mathematics and computer algebra system. It provides hands-on experience with cryptographic algorithms and supporting homework assignments. With Sage, the reader learns a powerful tool that can be used for virtually any mathematical application. The book also provides an unparalleled degree of support for the reader to ensure a successful learning experience.
14) MixColumns Transformation In the discussion of MixColumns, it was stated that there were two equivalent ways of defining the transformation. The first is the matrix multiplication shown in Equation (5. 3), which is repeated here: 02 01 D 01 03 03 02 01 01 01 03 02 01 01 s0, 0 01 s T D 1, 0 03 s2, 0 02 s3, 0 s0, 1 s1, 1 s2, 1 s3, 1 s0, 2 s1, 2 s2, 2 s3, 2 s0, 3 s′0, 0 s1, 3 s′ T = D 1, 0 s2, 3 s′2, 0 s3, 3 s′3, 0 s′0, 1 s′1, 1 s′2, 1 s′3, 1 s′0, 2 s′1, 2 s′2, 2 s′3, 2 s′0, 3 s′1, 3 T s′2, 3 s′3, 3 The second method is to treat each column of State as a four-term polynomial with coefficients in GF(28).
However, the inaccuracy and unscientific nature of such polls is well understood. Availability The more critical a component or service, the higher is the level of availability required. Consider a system that provides authentication services for critical systems, applications, and devices. An interruption of service results in the inability for customers to access computing resources and staff to access the resources they need to perform critical tasks. The loss of the service translates into a large financial loss in lost employee productivity and potential customer loss.
Page or call Pearson Faculty Services at 1-800-526-0485. The Companion Web site, at WilliamStallings. com/Cryptography (click on Instructor Resources link), includes the following: • Links to Web sites for other courses being taught using this book • Sign-up information for an Internet mailing list for instructors using this book to exchange information, suggestions, and questions with each other and with the author Projects and Other Student Exercises For many instructors, an important component of a cryptography or network security course is a project or set of projects by which the student gets hands-on experience to reinforce concepts from the text.
A new section covers this topic. • Elliptic Curve Digital Signature Algorithm (ECDSA): Because ECDSA is more efficient than other digital signature schemes, it is increasingly being adopted for digital signature applications. A new section covers ECDSA. • RSA Probabilistic Signature Scheme (RSA-PSS): RSA-based digital signature schemes are perhaps the most widely used. A new section covers the recently standardized RSA-PSS, which is in the process of replacing older RSA-based schemes. • True random number generator: True random number generators have traditionally had a limited role because of their low bit rate, but a new generation of hardware true random number generators is now available that is comparable in performance to software pseudorandom number generators.
New York: Dover, 1972. GARR01 Garrett, P. Making, Breaking Codes: An Introduction to Cryptology. Upper Saddle River, NJ: Prentice Hall, 2001. KAHN96 Kahn, D. The Codebreakers: The Story of Secret Writing. New York: Scribner, 1996. KATZ00 Katzenbeisser, S. , ed. Information Hiding Techniques for Steganography and Digital Watermarking. Boston: Artech House, 2000. 2. 7 / Key Terms, Review Questions, And Problems 55 KORN96 Korner, T. The Pleasures of Counting. Cambridge, England: Cambridge University Press, 1996.