QQ客服 官方微博 反馈留言

	High-speed constant-time division module for Elliptic Curve Cryptography based on GF(2m)
	Liao, Kai ; Cui, Xiaoxin ; Liao, Nan ; Wang, Tian ; Zhang, Xiao ; Huang, Ying ; Yu, Dunshan
	2014
英文摘要	To achieve high performance scalar multiplication arithmetic in Elliptic Curve Cryptography (ECC) based on GF(2m), a high-speed constant-time division module with optimized architecture is proposed in this paper. Modified from the traditional extended Euclidean Great Common Divisor (GCD) division algorithm, the presented algorithm computes a single multiplicative inverse or division in constant m iterations, i.e. m clock cycles, in GF(2m), which obtains a tremendous reduction (specifically more than 50%) on computing time compared with previous works. Combined with the meticulously optimized architecture, this novel division module achieves lower area-time complexity, which makes it an excellent option for high performance ECC design. ? 2014 IEEE.; EI; 0
语种	英语
DOI标识	10.1109/ISCAS.2014.6865261
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/294789]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Liao, Kai,Cui, Xiaoxin,Liao, Nan,et al. High-speed constant-time division module for Elliptic Curve Cryptography based on GF(2m). 2014-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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