Low‐latency digit‐serial dual basis multiplier for lightweight cryptosystems. (1st November 2017)

• Record Type: Journal Article
• Authors: Chiou, Che Wun; Lee, Chiou‐Yng; Lin, Jim‐Min; Yeh, Yun‐Chi; Pan, Jeng‐Shyang
• Is Part Of: IET information security. Volume 11:Number 6(2017)
• Page Start: 301
• Page End: 311
• Publication Date: 2017-11-01
• Subjects: cryptography -- resource allocation -- computational complexity -- parallel processing; low‐latency digit‐serial dual basis multiplier -- cryptosystems -- resource‐constrained security applications -- finite field multiplication -- space complexity -- time complexity -- submultiplication units -- parallel processing -- systolic structures -- four‐bit scheme -- critical path delay; Computer security -- Periodicals; Cryptography -- Periodicals; Computer networks -- Security measures -- Periodicals; Database security -- Periodicals; 005.8
• DOI: 10.1049/iet-ifs.2015.0336
• Languages: English
• ISSNs: 1751-8709

Abstract

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