Elliptic Curve Cryptography - Session 1

    Exercise 1
    Construct an Elliptic Curve over the Finite Field Set of all Integers Mod 7. Consider a=1 and b=2 in the equation. List the points on the curve and show the result of adding point P (3, 2) with itself. Show all intermediate results in your computation.
    
    Exercise 2
    Construct an Elliptic Curve over the Finite Field Set of all Integers Mod 9. Consider a=1 and b=2 in the equation. List the points on the curve and show the result of adding point P (4, 4) with itself. Show all intermediate results in your computation.
    
    Exercise 3
    Construct an Elliptic Curve over the Finite Field Set of all Integers Mod 11. Consider a=1 and b=2 in the equation. List the points on the curve and show the result of adding point P (6, 4) with itself. Show all intermediate results in your computation.
    
    Exercise 4
    Construct an Elliptic Curve over the Finite Field Set of all Integers Mod 7. Consider a=2 and b=2 in the equation. List the points on the curve and show the result of adding point P (4, 2) with itself. Show all intermediate results in your computation.
    
    Exercise 5
    Construct an Elliptic Curve over the Finite Field Set of all Integers Mod 13. Consider a=2 and b=1 in the equation. List the points on the curve and show the result of adding point P (8, 3) with itself. Show all intermediate results in your computation.
    
    Exercise 6
    Construct an Elliptic Curve over the Finite Field Set of all Integers Mod 11. Consider a=2 and b=2 in the equation. List the points on the curve and show the result of adding point P (5, 4) with itself. Show all intermediate results in your computation.