Scalable and Systolic Montgomery Multipliers over GF(2m)
作者： C.-C. CHEN , C.-Y. LEE , E.-H. LU
DOI: 10.1093/IETFEC/E91-A.7.1763
关键词:
摘要: This work presents a novel scalable and systolic Montgomery's algorithm in GF (2 m). The proposed algorithm is based on the Toeplitz matrix-vector representation, which obtains the …
unirioja.es
harvard.edu
acm.org
sci-hub.st 参考文章(25)
Chi-Tsong Chen, Linear System Theory and Design ,(1995)
Rudolf Lidl, Harald Niederreiter, Introduction to finite fields and their applications The Mathematical Gazette. ,vol. 72, pp. 335- ,(1986) , 10.1017/CBO9781139172769
Janusz Rajski, Jerzy Tyszer, Primitive Polynomials Over GF(2) of Degree up to 660 with Uniformly Distributed Coefficients Journal of Electronic Testing. ,vol. 19, pp. 645- 657 ,(2003) , 10.1023/A:1027422805851
Yusuf Leblebici, Sung-Mo (Steve) Kang, CMOS Digital Integrated Circuits Analysis & Design ,(1995)
A.P. Fournaris, O. Koufopavlou, GF(2/sup K/) multipliers based on Montgomery Multiplication Algorithm international symposium on circuits and systems. ,vol. 2, pp. 849- 852 ,(2004) , 10.1109/ISCAS.2004.1329405
Chiou-Yng Lee, Yung-Hui Chen, Che-Wun Chiou, Jim-Min Lin, Unified parallel systolic multiplier over GF(2 m ) Journal of Computer Science and Technology. ,vol. 22, pp. 28- 38 ,(2007) , 10.1007/S11390-007-9003-0
J. Massey, Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972) IEEE Transactions on Information Theory. ,vol. 19, pp. 373- 373 ,(1973) , 10.1109/TIT.1973.1055002
Peter L. Montgomery, Modular multiplication without trial division Mathematics of Computation. ,vol. 44, pp. 519- 521 ,(1985) , 10.1090/S0025-5718-1985-0777282-X
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
Vivek Kapoor, Vivek Sonny Abraham, Ramesh Singh, Elliptic curve cryptography Ubiquity. ,vol. 2008, pp. 7- ,(2008) , 10.1145/1378355.1378356