Includes bibliographical references (p. 195-198) and index.

PUBLIC KEY CRYPTOGRAPHY: Applications and Attacks; Contents; Preface; Acknowledgments; List of Figures; 1 INTRODUCTION; 1.1 The Meaning of the Word Cryptography; 1.2 Symmetric Key Cryptography; 1.2.1 Impact of Technology; 1.2.2 Confusion and Diffusion; 1.2.3 DES and AES; 1.3 Public Key (Asymmetric) Cryptography; 1.3.1 Diffie-Hellman Key Exchange; 1.3.2 RSA; 1.3.3 ElGamal; 1.4 Key Establishment; 1.5 Cryptography-More than just Hiding Secrets; 1.5.1 Digital Signatures; 1.5.2 Authentication; 1.5.3 Nonrepudiation; 1.6 Standards; 1.7 Attacks; 2 CONGRUENCE EQUATIONS; 2.1 Congruence Arithmetic. 2.1.1 Computer Examples2.1.2 Problems; 2.2 The Euclidean Algorithm-Finding Inverses; 2.2.1 Computer Examples; 2.2.2 Problems; 2.3 Discrete Logarithms and Diffie-Hellman Key Exchange; 2.3.1 Computer Examples; 2.3.2 Problems; 2.4 Attacking the Discrete Logarithm; 2.4.1 Computer Examples; 2.4.2 Problems; 3 THE ELGAMAL SCHEME; 3.1 Primitive Roots; 3.1.1 Computer Examples; 3.1.2 Problems; 3.2 The ElGamal Scheme; 3.2.1 Computer Examples; 3.2.2 Problems; 3.3 Security of the ElGamal Scheme; 3.3.1 Computer Examples; 3.3.2 Problems; 4 THE RSA SCHEME; 4.1 Euler's Theorem; 4.1.1 Computer Examples. 4.1.2 Problems4.2 The RSA Algorithm; 4.2.1 The RSA Parameters; 4.2.2 Computer Examples; 4.2.3 Problems; 4.3 RSA Security; 4.3.1 Computer Examples; 4.3.2 Problems; 4.4 Implementing RSA; 4.4.1 Computer Examples; 4.4.2 Problems; 5 ELLIPTIC CURVE CRYPTOGRAPHY; 5.1 Elliptic Curves and Elliptic Curve Groups; 5.1.1 What is an Elliptic Curve?; 5.1.2 Operations on Points; 5.1.3 Adding a Point to Its Negative; 5.1.4 Adding a Point to Itself; 5.1.5 Computer Examples; 5.1.6 Problems; 5.2 Elliptic Curve Cryptography; 5.2.1 Elliptic Curve Groups and the Discrete Logarithm Problem. 5.2.2 An Elliptic Curve ElGamal System5.2.3 Elliptic Curve Key Exchange (ECKE); 5.2.4 Computer Examples; 5.2.5 Problems; 5.3 The Elliptic Curve Factoring Scheme; 5.3.1 Computer Examples; 5.3.2 Problems; 6 DIGITAL SIGNATURES; 6.1 Hash Functions; 6.1.1 SHA-1; 6.1.2 MD5; 6.1.3 The Search for New Hash Functions; 6.1.4 Computer Examples; 6.1.5 Problems; 6.2 Digital Signature Schemes; 6.2.1 Direct Digital Signature Schemes; 6.2.2 Using RSA for Signing; 6.2.3 Using ElGamal for Signing; 6.2.4 Arbitrated Digital Signature Schemes; 6.2.5 The Digital Signature Standard; 6.2.6 Computer Examples. 6.2.7 Problems6.3 Attacks on Digital Signatures; 6.3.1 The Birthday Attack; 6.3.2 Intruder-in-the-Middle Attack; 6.3.3 Intruder-in-the-Middle and Diffie-Hellman; 6.3.4 An Attack on RSA Signatures: What if Eve Uses Alice's Signature?; 6.3.5 Protecting ElGamal with Signatures; 6.3.6 Oscar Tries to Trick Bob; 6.3.7 Oscar Captures a Message with a Signed Version; 6.3.8 Alice Reuses a Random Number; 6.3.9 Computer Examples; 6.3.10 Problems; 7 PRIMALITY TESTING; 7.1 Fermat's Approach and Wilson's Theorem; 7.1.1 Computer Examples; 7.1.2 Problems; 7.2 The Miller-Selfridge-Rabin Primality Test.

This book covers public-key cryptography, describing in depth all major public-key cryptosystems in current use, including ElGamal, RSA, Elliptic Curve, and digital signature schemes. It explains the underlying mathematics needed to build these schemes, and examines the most common techniques used in attacking them. Illustrated with many examples, the book provides a solid foundation for professionals in government, cloud service providers, and large enterprises using public-key systems to secure their data. It is also useful for those taking the CISSP exam (Certified Information Systems Secure.

CSCI361