High‐throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems. Issue 5 (11th April 2018)

• Record Type: Journal Article
• Authors: Chiou, Che Wun; Lee, Cheng‐Min; Sun, Yuh‐Sien; Lee, Chiou‐Yng; Lin, Jim‐Min
• Is Part Of: IET computers & digital techniques. Volume 12:Issue 5(2018)
• Page Start: 187
• Page End: 191
• Publication Date: 2018-04-11
• Subjects: cryptography -- digital signatures; high‐throughput Dickson basis multiplier -- trinomial -- lightweight cryptosystems -- high‐throughput systolic Dickson basis multiplier -- Gaussian normal basis -- squaring operations -- multiplication operations -- digital signatures; Computers -- Periodicals; Digital electronics -- Periodicals; Computer engineering -- Periodicals; Computer architecture -- Periodicals; Computer organization -- Periodicals; 621.39
• DOI: 10.1049/iet-cdt.2017.0209
• Languages: English
• ISSNs: 1751-8601

Abstract

Abstract : 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.