Open AccessLow‐latency digit‐serial dual basis multiplier for lightweight cryptosystems
Author(s) -
Chiou Che Wun,
Lee ChiouYng,
Lin JimMin,
Yeh YunChi,
Pan JengShyang
Publication year - 2017
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2015.0336
Subject(s) - multiplier (economics) , cryptosystem , arithmetic , finite field , computer science , gf(2) , elliptic curve cryptography , multiplication (music) , critical path method , polynomial basis , parallel computing , multiplication algorithm , cryptography , mathematics , algorithm , public key cryptography , binary number , encryption , discrete mathematics , mathematical analysis , systems engineering , combinatorics , engineering , economics , macroeconomics , operating system
Various cryptosystems, such as elliptic curve and pairing‐based cryptosystems, in resource‐constrained security applications rely on finite field multiplication. For applications such as these, a digit‐serial multiplier has the potential features to achieve a trade‐off between space and time complexities. The authors propose an efficient decomposition of the multiplication into four independent sub‐multiplication units to facilitate parallel processing, which is additionally facilitated by the systolic structures of the sub‐multiplication units. The proposed architecture uses a four‐bit scheme to construct a novel processing element, instead of using only one bit as is currently used in similar multipliers. The results of the synthesis show that the proposed digit‐serial dual basis multiplier eliminates up to 96% of the critical path delay.