
In Week 1, we will explain the mathematical mechanisms underlying the security of modern cryptography. These are one-way functions, which have the property of being easy to compute in the forward direction but hard to compute the inverse. By learning examples of representative cryptographic schemes based on this property, we will deepen our understanding of the basic principles of modern cryptography.
- 1-1. Introduction
- 1-2. One-way function 1: Prime factorization problem
- 1-3. One-way function 2: RSA problem
- 1-4. One-way function 3: Discrete logarithm problem
- 1-5. Hash function and Pseudorandom Number Generator
- 1-6. Diffie-Hellman key exchange
- 1-7. ElGamal Cryptosystem
- 1-8. RSA Cryptosystem
- 1-9. RSA signature scheme









