Open AccessHigh‐throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems
Author(s) -
Chiou Che Wun,
Lee ChengMin,
Sun YuhSien,
Lee ChiouYng,
Lin JimMin
Publication year - 2018
Publication title -
iet computers and digital techniques
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.219
H-Index - 46
ISSN - 1751-861X
DOI - 10.1049/iet-cdt.2017.0209
Subject(s) - trinomial , multiplier (economics) , basis (linear algebra) , throughput , computation , computer science , parallel computing , arithmetic , normal basis , elliptic curve cryptography , digital signature , mathematics , cryptosystem , algorithm , cryptography , discrete mathematics , encryption , public key cryptography , galois theory , telecommunications , economics , wireless , macroeconomics , hash function , geometry , computer security , operating system
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.