Concurrent realization of the multiply-by-7 Elliptic Curve Scalar Multiplication algorithm

This paper investigates the multiply-by-7 Elliptic Curve (EC) point P Scalar Multiplication algorithm for reduced computational complexity and enhanced inherent parallel property based on the Area-Time (AT²) metric. The findings were compared with those obtained when the algorithm was again realized on the Jacobian projective coordinate and the Non-Adjacent Form (NAF). The investigation revealed 27% and 8% computational complexity reductions over the Jacobian and NAF realizations. The algorithm also presents the best AT² value.