Provided by: International Journal of Network Security
Date Added: Sep 2009
The most computationally efficient Digital Signature (DS) algorithms are based on Elliptic Curves (ECs) over finite fields. The well known DS standards ECDSA and GOST R 34.10 specify EC-based algorithms over the ground fields GF(p). However in many cases of the practical use of DS algorithms there are required the DS schemes providing higher performance in hardware and in software. To meet such requirements there have been proposed different approaches to accelerated the EC-based cryptographic algorithms. These approaches can be categorized into two groups: high-level algorithm that manage the ECs selection and low-level algorithm that manage the finite field operation.