High-throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems

In this study, the authors propose a high-throughput systolic Dickson basis multiplier over GF(2(m)). Use of the Dickson basis seems promising when no Gaussian normal basis exists for the field, and it can easily carry out both squaring and multiplication operations. Many squaring operations and multiplications are needed when computing the digital signatures of elliptic curve digital signature algorithm. The proposed systolic Dickson basis multiplier can concurrently compute a great number of multiplications with a high-throughput rate, thereby substantially increasing the speed of computation for digital signatures.