Tutorial on Elliptic Curve Arithmetic and Introduction to Elliptic Curve Cryptography (ECC)
Nithesh Venkata Ramana Surya Bommireddipalli · OhioLink ETD Center (Ohio Library and Information Network) · 2017
This thesis focuses on elliptic curve arithmetic over the prime field GF (p) and elliptic curve cryptography (ECC).ECC over GF(p) has its own arithmetic which is done over elliptic curves of the form y 2 ≡ x 3 +ax+b (mod p), where p is prime.ECC is gaining importance in security because it uses smaller keys to provide the same security level as the popular RSA.It is the superior cryptographic scheme based on time efficiency and resource utilization.It is more suitable than RSA for DNSSEC and IoT systems and devices.Unlike RSA, which is easily understood, ECC is complicated because of the arithmetic involved.It is not widely understood.We provide a tutorial on elliptic curve arithmetic and also