Key Exchange

Chapter Contents

1. 13.1.Cyclic groups
2. 13.1.1.The discrete logarithm problem
3. 13.1.2.Efficient exponentiations
4. 13.2.Diffie-Hellman key exchange
5. 13.2.1.Passive Security
6. 13.2.2.Choosing a strong cyclic group
7. 13.3.Key exchange in the abstract
8. 13.4.☆ Elliptic curves
9. 13.4.1.Elliptic curves over the real numbers
10. 13.4.2.Elliptic curves modulo a prime
11. 13.4.3.Elliptic curves in Sage
12. 13.4.4.Pitfalls and fine print
13. Exercises
14. Chapter Notes & References

1. Previous Chapter12. Random Oracles and Other Idealized Models
2. Next Chapter14. Public-Key Encryption