Public Key Cryptography by Batten, Lynn Margaret -- Read -- Imperial Library of Trantor

Index

Cover Title Page Series Page Copyright Dedication Preface Acknowledgments List of Figures Chapter 1: Introduction

1.1 The Meaning of the Word Cryptography 1.2 Symmetric Key Cryptography 1.3 Public Key (Asymmetric) Cryptography 1.4 Key Establishment 1.5 Cryptography—more than just Hiding Secrets 1.6 Standards 1.7 Attacks

Chapter 2: Congruence Equations

2.1 Congruence Arithmetic 2.2 The Euclidean Algorithm—Finding Inverses 2.3 Discrete Logarithms and Diffie–Hellman Key Exchange 2.4 Attacking the Discrete Logarithm

Chapter 3: The ElGamal Scheme

3.1 Primitive Roots 3.2 The ElGamal Scheme 3.3 Security of the ElGamal Scheme

Chapter 4: The RSA Scheme

4.1 Euler's Theorem 4.2 The RSA Algorithm 4.3 RSA Security 4.4 Implementing RSA

Chapter 5: Elliptic Curve Cryptography

5.1 Elliptic Curves and Elliptic Curve Groups 5.2 Elliptic Curve Cryptography 5.3 The Elliptic Curve Factoring Scheme

Chapter 6: Digital Signatures

6.1 Hash Functions 6.2 Digital Signature Schemes 6.3 Attacks on Digital Signatures

Chapter 7: Primality Testing

7.1 Fermat's Approach and Wilson's Theorem 7.2 The Miller–Selfridge–Rabin Primality Test 7.3 True Primality Tests 7.4 Mersenne Primes and the Lucas–Lehmer Test 7.5 Primes is in P

Chapter 8: Factoring Methods

8.1 Fermat Again 8.2 The Quadratic Sieve 8.3 Pollard's p − 1 and rho Methods 8.4 Continued Fractions and Factoring

Appendix: Solutions to Problems Notation Bibliography Index Books in the IEEE Press Series on: Information and Communication Networks Security