RSA

Chapter Contents

1. 15.1.Arithmetic modulo a composite
2. 15.1.1.Computing inverses
3. 15.1.2.Algebraic properties
4. 15.2.The RSA function and RSA assumption
5. 15.2.1.Security and $e$th roots
6. 15.3.Building a KEM from RSA
7. 15.4.☆ Chinese remainder theorem
8. 15.4.1.Using CRT for modular arithmetic
9. 15.4.2.Applications to RSA
10. Exercises
11. Chapter Notes & References

1. Previous Chapter14. Public-Key Encryption
2. Next Chapter16. Digital Signatures