QQ客服 官方微博 反馈留言

	An area-efficient design for modular inversion in GF(2(m))
	Wang, Jian ; Jiang, Anping
	2006
关键词	modular inversion Galois Field VLSI implementation Euclid&apos MULTIPLICATIVE INVERSION DIVISION ARCHITECTURES s algorithm
英文摘要	Modular inversion is one of the kernel arithmetic operations in error control codes and cryptography, so the design of the low-cost and high-speed hardware implementation is absolutely necessary. A novel algorithm and hardware implementation for modular inversion in finite fields GF(2(m)) with the standard basis representation is presented. The algorithm used is based on a modification of the extended Euclid's algorithm. The proposed architecture is O(m) area complexity and O(m) time complexity. It is highly regular, modular and thus well suited to VLSI implementation. Compared with two related architectures with the same time complexity, ours can save at least 22.5% combinational area.; Computer Science, Hardware & Architecture; Engineering, Electrical & Electronic; Telecommunications; CPCI-S(ISTP); 0
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/388591]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang, Jian,Jiang, Anping. An area-efficient design for modular inversion in GF(2(m)). 2006-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。