Extensively revised and updated, the 3rd Edition of Introduction to Cryptography with Coding Theory mixes applied and theoretical aspects to build a solid foundation in cryptography and security. Key to the new edition was transforming from a primarily print-based resource to a digital learning tool. The eText is packed with content and tools, such as interactive examples, that help bring course content to life for students and enhance instruction. Pearson eText is a simple-to-use, mobile-optimized, personalized reading experience. It lets students highlight, take notes, and review key vocabulary all in one place, even when offline. Seamlessly integrated videos and other rich media engage students and give them access to the help they need, when they need it.
|Published (Last):||12 November 2012|
|PDF File Size:||4.72 Mb|
|ePub File Size:||18.68 Mb|
|Price:||Free* [*Free Regsitration Required]|
View larger. Request a copy. Download instructor resources. Additional order info. Buy this product. With its lively, conversational tone and practical focus, this new edition mixes applied and theoretical aspects for a solid introduction to cryptography and security, including the latest significant advancements in the field.
Secure Communications. Cryptographic Applications. Shift Ciphers. Affine Ciphers. Substitution Ciphers.
Sherlock Holmes. Block Ciphers. One-Time Pads. Pseudo-random Bit Generation. LFSR Sequences. Computer Problems. Basic Notions. The Chinese Remainder Theorem. Modular Exponentiation. Fermat and Euler. Primitive Roots. Inverting Matrices Mod n. Square Roots Mod n. Legendre and Jacobi Symbols. Finite Fields. Continued Fractions. Differential Cryptanalysis. Modes of Operation. Breaking DES. Meet-in-the-Middle Attacks. Password Security. The Basic Algorithm. The Layers. Design Considerations.
The RSA Algorithm. Attacks on RSA. Primality Testing. The RSA Challenge. An Application to Treaty Verification. The Public Key Concept. Discrete Logarithms. Computing Discrete Logs. ElGamal Public Key Cryptosystems. Hash Functions. A Simple Hash Example. The Secure Hash Algorithm. Birthday Attacks. The Random Oracle Model. Using Hash Functions to Encrypt. RSA Signatures.
The ElGamal Signature Scheme. Hashing and Signing. Birthday Attacks on Signatures. The Digital Signature Algorithm. Intruders-in-the-Middle and Impostors. Key Distribution. Pretty Good Privacy. Secure Electronic Transaction. Digital Cash. Secret Splitting. Threshold Schemes.
Flipping Coins over the Telephone. Poker over the Telephone. The Basic Setup. Probability Review. Huffman Codes. Perfect Secrecy. The Entropy of English.
The Addition Law. Elliptic Curves Mod n. Factoring with Elliptic Curves. Elliptic Curves in Characteristic 2. Elliptic Curve Cryptosystems. Identity-Based Encryption. Lattice Reduction. An Attack on RSA. Error Correcting Codes. Bounds on General Codes. Linear Codes.
Hamming Codes. Golay Codes. Cyclic Codes. BCH Codes. Reed-Solomon Codes. The McEliece Cryptosystem. Other Topics. A Quantum Experiment.
Quantum Key Distribution. Mathematica Examples. Maple Examples. Further Reading. Pearson offers special pricing when you package your text with other student resources. If you're interested in creating a cost-saving package for your students, contact your Pearson rep.
We're sorry! We don't recognize your username or password. Please try again. The work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning. You have successfully signed out and will be required to sign back in should you need to download more resources.
Introduction to Cryptography with Coding Theory
View larger. Request a copy. Download instructor resources. Additional order info. Buy this product.
Introduction to Cryptography with Coding Theory, 3rd Edition
Introduction to Cryptography with Coding Theory, 2nd Edition