An improved implementation of elliptic curve digital signature by using sparse elements

Abstract EN

This paper introduces several new techniques and algorithms to speed up the elliptic curve digital signature and reduce the size of the transited parameters.

The basic idea is to use sparse elements for the curve coefficients and the first base point coordinate.

The implementation analysis shows that the addition formula calculations are improved about 40 percent.

The sparse elements are introduced with a compact representation, thus the digital signature calculations are speeded up about 40-60 percent, and the public key parameters are reduced about 37-48 percent.