Scalable and systolic Montgomery multiplier over GF(2 m ) generated by trinomials
作者： C.-Y. Lee , C.W. Chiou , J.-M. Lin , C.-C. Chang
关键词: Very-large-scale integration 、 Mathematics 、 GF(2) 、 Multiplier (economics) 、 Finite field 、 Arithmetic 、 Computational complexity theory 、 Hardware architecture 、 Time complexity 、 Trinomial
摘要: A Montgomery's algorithm in GF(2m) based on the Hankel matrix–vector representation is proposed. The hardware architecture obtained from this indicates low-complexity bit-parallel systolic multipliers with irreducible trinomials. results reveal that proposed multiplier saves approximately 36% of space complexity as compared to an existing Montgomery for scalable and also developed by applying block-Hankel representation. demonstrated have significantly less time–area product than digit-serial architectures. Furthermore, architectures regularity, modularity local interconnectability, making them highly appropriate VLSI implementation.
aip.org
sci-hub.se 参考文章(32)
Rudolf Lidl, Harald Niederreiter, Finite fields: Author Index ,(1996) , 10.1017/CBO9780511525926
Rudolf Lidl, Harald Niederreiter, Introduction to finite fields and their applications The Mathematical Gazette. ,vol. 72, pp. 335- ,(1986) , 10.1017/CBO9781139172769
Yusuf Leblebici, Sung-Mo (Steve) Kang, CMOS Digital Integrated Circuits Analysis & Design ,(1995)
Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2 m ) Using LSB First Algorithm Fuzzy Logic and Applications. pp. 420- 426 ,(2006) , 10.1007/11676935_52
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
N.-Y. Kim, H.-S. Kim, K.-Y. Yoo, Computation of AB2 multiplication in GF(2m) using low-complexity systolic architecture IEE Proceedings - Circuits, Devices and Systems. ,vol. 150, pp. 119- 123 ,(2003) , 10.1049/IP-CDS:20030337
Peter L. Montgomery, Modular multiplication without trial division Mathematics of Computation. ,vol. 44, pp. 519- 521 ,(1985) , 10.1090/S0025-5718-1985-0777282-X
O. Nibouche, A. Bouridane, M. Nibouche, Architectures for Montgomery's multiplication IEE Proceedings - Computers and Digital Techniques. ,vol. 150, pp. 361- 368 ,(2003) , 10.1049/IP-CDT:20030567
Neil H. E. Weste, Kamran Eshraghian, Principles of CMOS VLSI Design: A Systems Perspective ,(1985)
Chiou-Yng Lee, Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials IEE Proceedings - Computers and Digital Techniques. ,vol. 150, pp. 39- 42 ,(2003) , 10.1049/IP-CDT:20030061