QQ客服 官方微博 反馈留言

	New word-based montgomery algorithm for higher radices
	Wang, Tian ; Cui, Xiaoxin ; Liao, Kai ; Liao, Nan
	2014
英文摘要	Montgomery algorithm is widely used in public-key cryptosystems. In this paper a new word-based Montgomery algorithm suitable for higher radices has been presented and a new modular multiplication block based on it has been designed. The latency between neighboring processing elements can be reduced to one clock period by deferring the calculation of several bits of each word to the next processing element. The radix 2, 4 and 8 modular multiplication block has been implemented with SMIC 0.13um technology and Xilinx Virtex II series FPGA. The proposed design with radix 2 and 4 achieves area reduction with almost the same performance in speed, compared to other designs of the same radix. And the radix-8 block gains at least 10% time reduction in completing a 1024-bit Montgomery multiplication. ? 2014 IEEE.; EI; 0
语种	英语
DOI标识	10.1109/ICSICT.2014.7021502
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/295379]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang, Tian,Cui, Xiaoxin,Liao, Kai,et al. New word-based montgomery algorithm for higher radices. 2014-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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