Low-Latency High-Throughput Systolic Multipliers Over $GF(2^{m})$ for NIST Recommended Pentanomials

作者: Jiafeng Xie , Pramod Kumar Meher , Zhi-Hong Mao

DOI: 10.1109/TCSI.2014.2386782

关键词:

摘要: Recently, finite field multipliers having high-throughput rate and low-latency have gained great attention in emerging cryptographic systems, but such over GF(2 m ) for National Institute Standard Technology (NIST) pentanomials are not so abundant. In this paper, we present two pairs of bit-parallel digit-serial systolic based on NIST pentanomials. We propose a novel decomposition technique to realize the multiplication by several parallel arrays 2-dimensional (2-D) structure (BP-I) with critical-path 2TX, where TX is propagation delay an XOR gate. The 2-D then projected along vertical direction obtain (DS-I) same critical-path. For applications, another pair (BP-II) (DS-II) structures modular reduction technique, reduced (TA+TX), TA being AND A strategy data sharing between processing elements (PEs) adjacent has been proposed reduce area-complexity BP-I BP-II further. From synthesis results, it shown that significantly lower latency higher throughput than existing designs. To best authors' knowledge, first report fields independent field-order.

参考文章(17)
Leilei Song, Keshab K. Parhi, Low-Energy Digit-Serial/Parallel Finite Field Multipliers application specific systems architectures and processors. ,vol. 19, pp. 149- 166 ,(1998) , 10.1023/A:1008013818413
N.R. Murthy, M.N.S. Swamy, Cryptographic applications of Brahmagupta-Bha/spl tilde/skara equation IEEE Transactions on Circuits and Systems I-regular Papers. ,vol. 53, pp. 1565- 1571 ,(2006) , 10.1109/TCSI.2006.875177
Jiafeng Xie, Jian jun He, Pramod Kumar Meher, Low Latency Systolic Montgomery Multiplier for Finite Field $GF(2^{m})$ Based on Pentanomials IEEE Transactions on Very Large Scale Integration Systems. ,vol. 21, pp. 385- 389 ,(2013) , 10.1109/TVLSI.2012.2185257
Che-Wun Chiou, Chiou-Yng Lee, An-Wen Deng, Jim-Min Lin, Concurrent Error Detection in Montgomery Multiplication over GF(2m) IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. ,vol. 89, pp. 566- 574 ,(2006) , 10.1093/IETFEC/E89-A.2.566
Yeh, Reed, Truong, Systolic Multipliers for Finite Fields GF(2 m ) IEEE Transactions on Computers. ,vol. 33, pp. 357- 360 ,(1984) , 10.1109/TC.1984.1676441
Jeng-Shyang Pan, Chiou-Yng Lee, Pramod Kumar Meher, Low-Latency Digit-Serial and Digit-Parallel Systolic Multipliers for Large Binary Extension Fields IEEE Transactions on Circuits and Systems. ,vol. 60, pp. 3195- 3204 ,(2013) , 10.1109/TCSI.2013.2264694
Jiafeng Xie, Pramod Kumar Meher, Jianjun He, Low-Complexity Multiplier for $GF(2^{m})$ Based on All-One Polynomials IEEE Transactions on Very Large Scale Integration Systems. ,vol. 21, pp. 168- 173 ,(2013) , 10.1109/TVLSI.2011.2181434
Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon, A digit-serial multiplier for finite field GF(2/sup m/) IEEE Transactions on Very Large Scale Integration Systems. ,vol. 13, pp. 476- 483 ,(2005) , 10.1109/TVLSI.2004.842923
S.K. Jain, L. Song, K.K. Parhi, Efficient semisystolic architectures for finite-field arithmetic IEEE Transactions on Very Large Scale Integration Systems. ,vol. 6, pp. 101- 113 ,(1998) , 10.1109/92.661252
Arash Hariri, Arash Reyhani-Masoleh, Digit-Level Semi-Systolic and Systolic Structures for the Shifted Polynomial Basis Multiplication Over Binary Extension Fields IEEE Transactions on Very Large Scale Integration Systems. ,vol. 19, pp. 2125- 2129 ,(2011) , 10.1109/TVLSI.2010.2066994