Fast bit-parallel GF(2/sup n/) multiplier for all trinomials
作者： Haining Fan , Yiqi Dai
DOI: 10.1109/TC.2005.64
关键词: Trinomial 、 Discrete mathematics 、 Finite field 、 XOR gate 、 GF(2) 、 Time complexity 、 Multiplier (economics) 、 Mathematics 、 Polynomial basis 、 Computational complexity theory
摘要: Based on a new representation of GF(2/sup n/), we present two multipliers for all irreducible trinomials. Space complexities the match best results. The time complexity one multiplier is T/sub A/ + (1 [log/sub 2/ n])T/sub X/ trinomials, where and are delay 2-input AND XOR gates, respectively.
sci-hub.se 参考文章(12)
Edoardo D. Mastrovito, Vlsi designs for multiplication over finite fields GF(2m) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. pp. 297- 309 ,(1989) , 10.1007/3-540-51083-4_67
C. Paar, A new architecture for a parallel finite field multiplier with low complexity based on composite fields IEEE Transactions on Computers. ,vol. 45, pp. 856- 861 ,(1996) , 10.1109/12.508323
Huapeng Wu, Montgomery multiplier and squarer for a class of finite fields IEEE Transactions on Computers. ,vol. 51, pp. 521- 529 ,(2002) , 10.1109/TC.2002.1004591
A Halbutogullari, Cetin Kaya Koc, Mastrovito multiplier for general irreducible polynomials IEEE Transactions on Computers. ,vol. 49, pp. 503- 518 ,(2000) , 10.1109/12.859542
Leilei Song, K.K. Parhi, Low-complexity modified Mastrovito multipliers over finite fields GF(2/sup M/) international symposium on circuits and systems. ,vol. 1, pp. 508- 512 ,(1999) , 10.1109/ISCAS.1999.777940
H. Wu, M.A. Hasan, I.F. Blake, New low-complexity bit-parallel finite field multipliers using weakly dual bases IEEE Transactions on Computers. ,vol. 47, pp. 1223- 1234 ,(1998) , 10.1109/12.736433
Cetin Kaya Koc, Tolga Acar, Montgomery Multiplication in GF(2 ^k Designs, Codes and Cryptography. ,vol. 14, pp. 57- 69 ,(1998) , 10.1023/A:1008208521515
Huapeng Wu, Bit-parallel finite field multiplier and squarer using polynomial basis IEEE Transactions on Computers. ,vol. 51, pp. 750- 758 ,(2002) , 10.1109/TC.2002.1017695
Tong Zhang, K.K. Parhi, Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials IEEE Transactions on Computers. ,vol. 50, pp. 734- 749 ,(2001) , 10.1109/12.936239
F. Rodriguez-Henriquez, Cetin Kaya Koc, Parallel multipliers based on special irreducible pentanomials IEEE Transactions on Computers. ,vol. 52, pp. 1535- 1542 ,(2003) , 10.1109/TC.2003.1252850