Abstract

The research presents the elliptic curve algorithm in addition to measures and countermeasures for Sign Change Fault attacks (SCF) and side-channel attacks (SCA) on the elliptic curve algorithm (ECC). The attack and countermeasures are studied in the ambience of exact projective coordinates and ECC on the main fields. The combination between countermeasures both SCF Attacks and SCA on ECC is envisioned to potency the device to discharge objects on a curve that is coded weakly. The research presents the enhancement of security of hybrid-ECC for defending against types of attacks. In elliptic curve cryptography, side-channel attacks take place when data is unintentionally leaked while being processed. Calculating n*P, where n is a positive integer and P is a point on the elliptic curve E, is a crucial operation. The binary algorithm's implementations may show whether P + Q is calculated for P=6*Q or P=Q, depending on the circumstances. There are many solutions that have been proposed for this issue. Here, we outline a generic method for creating a variety of representations of the points on E with characteristic p $\ge$ 5, each with a consistent application of P+Q. For each n*P computation, the parametrization can be modified effectively for free. It works with all elliptic curves. Hence, all others ECC included in the current and future standards for p $\ge$ 5 may be used with them. In characteristic p $\ge$ 5.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call