1. Generator

(b) Diffie-Hellman Key Exange Protocol

• allows two parties to agree a secret key over an insecure channel without having met before.
• Its security is based on the discrete logarithm problem in a finite abelian group G.

2. Euler’s Theorem is the extension of Fermat’s Theorem.

(c) the last 3 digits of 8^803

8^{803}  \mod 1000 \equiv 8 \times 64^{400+1} \mod 1000 \equiv 8 \times 64 \equiv 512


5. system of equations

Still don't get it...

Donation

If this blog post happens to be helpful to you, besides of leaving a reply, you may consider buy me a cup of coffee to support me. It would help me write more articles helpful to you in the future and I would really appreciate it.