Design of a high-speed RSA encryption processor with built-in table for residue calculation of redundant binary numbers

N. Tomabechi, T. Ito
{"title":"Design of a high-speed RSA encryption processor with built-in table for residue calculation of redundant binary numbers","authors":"N. Tomabechi, T. Ito","doi":"10.1109/ISCAS.2000.857583","DOIUrl":null,"url":null,"abstract":"This paper proposes a design method of a high-speed RSA encryption processor in which the residue calculation of the redundant binary numbers is realized by table-look-up method where the table is built in the hardware, It is demonstrated that the number of gates through the critical path determining the operation speed of the proposed processor is 1/62 that of the conventional processors.","PeriodicalId":6422,"journal":{"name":"2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353)","volume":"140 1","pages":"697-700 vol.5"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAS.2000.857583","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This paper proposes a design method of a high-speed RSA encryption processor in which the residue calculation of the redundant binary numbers is realized by table-look-up method where the table is built in the hardware, It is demonstrated that the number of gates through the critical path determining the operation speed of the proposed processor is 1/62 that of the conventional processors.
设计一种高速RSA加密处理器,内置冗余二进制数残数计算表
本文提出了一种高速RSA加密处理器的设计方法,通过在硬件中建立表的查表方法来实现冗余二进制数的剩余计算,并证明了决定该处理器运行速度的关键路径的门数是传统处理器的1/62。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信