N. A. Moldovyan and P. A. Moldovyanu
New primitives for digital signature algorithms

Particular types of the multiplication operation over elements of the finite vector space over the field GF(p^d), are introduced so that there are formed the finite fields GF((p^d)^m) with fast multiplication operation that also suites well to parallelized implementation. Finite fields implemented in such form are proposed for accelerating the digital signature algorithms.