A Review on Elliptic Curve Cryptography
Sujith Narayan
Abstract
Sujith Narayan
Abstract
Cryptography method depends upon complex mathematical problems like prime number factorization and elliptic curve discrete logarithm problem. Elliptic curve point multiplication is a method of adding a point to an elliptic curve on a continuous manner. It is used in Elliptic Curve Cryptography (ECC) to produce a trapdoor function. This paper presents detailed overview of the elliptic curve cryptography techniques. The limitation of the each paper was studied well to focus better on the proposed secret image sharing schemes.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Cryptography method depends upon complex mathematical problems like prime number factorization and elliptic curve discrete logarithm problem. Elliptic curve point multiplication is a method of adding a point to an elliptic curve on a continuous manner. It is used in Elliptic Curve Cryptography (ECC) to produce a trapdoor function. This paper presents detailed overview of the elliptic curve cryptography techniques. The limitation of the each paper was studied well to focus better on the proposed secret image sharing schemes.
Key concepts: Elliptic curve cryptography, Counting points on elliptic curves, Elliptic curve point multiplication, Hessian form of an elliptic curve, Tripling-oriented Doche–Icart–Kohel curve, Elliptic Curve Digital Signature Algorithm, Hyperelliptic curve cryptography, Elliptic curve