Scalable and Systolic Montgomery Multiplier over GF(2^m) Generated by Trinomials

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6431

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6431

题名:	Scalable and Systolic Montgomery Multiplier over GF(2^m) Generated by Trinomials
作者:	Lee, C. Y.;Chiou, C. W.;Lin, J. M.;Chang, C. C.
日期:	2007-12
上传时间:	2009-12-17 06:57:55 (UTC+0)
出版者:	Asia University
摘要:	A Montgomery's algorithm in GF(2m) based on the Hankel matrix-vector representation is proposed. The hardware architecture obtained from this algorithm indicates low-complexity bit-parallel systolic multipliers with irreducible trinomials. The results reveal that the proposed multiplier saves approximately 36% of space complexity as compared to an existing systolic Montgomery multiplier for trinomials. A scalable and systolic Montgomery multiplier is also developed by applying the block-Hankel matrix-vector representation. The proposed scalable systolic architecture is demonstrated to have significantly less time-area product complexity than existing digit-serial systolic architectures. Furthermore, the proposed architectures have regularity, modularity and local interconnectability, making the.m highly appropriate for VLSI implementation.
關聯:	IET Circuits, Devices & Systems 1(6):477-484
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
		0Kb	Unknown	483	检视/开启
310904400-6431 .doc		70Kb	Microsoft Word	312	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.