首页 | 本学科首页   官方微博 | 高级检索  
     检索      

RSA加密中基于二次Booth编码的Montgomery乘法器
引用本文:王田,崔小欣,廖凯,廖楠,黄颖,张潇,于敦山.RSA加密中基于二次Booth编码的Montgomery乘法器[J].北京大学学报(自然科学版),2014,50(4):642-646.
作者姓名:王田  崔小欣  廖凯  廖楠  黄颖  张潇  于敦山
作者单位:北京大学信息科学技术学院微电子学研究院, 北京 100871;
摘    要:研究可用于Montgomery算法的基于二次编码的不同阶的Booth大数乘法器的性能和面积。 通过SMIC 0.13μm工艺实现的阶64, 128和256的128 bit和256 bit的Booth大数乘法器, 分别在160 MHz和125 MHz的频率下实现模乘运算。 实验结果表明, 阶64, 128和256的Booth乘法器在速度上性能一致, 但随着阶的增加, 由于预计算和产生部分积的复杂度上升, 乘法器的面积将增加。

关 键 词:Montgomery乘法器  Booth算法  二次Booth编码  高阶Booth乘法器  
收稿时间:2013-04-05

Montgomery Multiplier Based on Secondary Booth Encoding in RSA Encryption
WANG Tian;CUI Xiaoxin;LIAO Kai;LIAO Nan;HUANG Ying;ZHANG Xiao;YU Dunshan.Montgomery Multiplier Based on Secondary Booth Encoding in RSA Encryption[J].Acta Scientiarum Naturalium Universitatis Pekinensis,2014,50(4):642-646.
Authors:WANG Tian;CUI Xiaoxin;LIAO Kai;LIAO Nan;HUANG Ying;ZHANG Xiao;YU Dunshan
Institution:Institute of Microelectronics, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871;
Abstract:The authors discuss the performance and area of different large-scale Booth multipliers with high radices used in Montgomery algorithm using secondary encoded scheme. The modular multiplication is implemented with SMIC 0.13μm technology at the frequency of 160 MHz and 125 MHz respectively based on the 128-bit multiplier and 256-bit multiplier with Booth 64, 128 and 256 encoding. Experiment result shows that the multiplier with Booth 64, 128 and 256 can achieve the same timing performance, while the area rises as radix rises due to the complexity in pre-computation and partial product generation.
Keywords:Montgomery multiplier  Booth’s algorithm  secondary Booth encoding scheme  Booth multiplier with high radix  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《北京大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号