改进的RSA算法的设计与实现

Yun-fei Li, Qing Liu, Tong Li
{"title":"改进的RSA算法的设计与实现","authors":"Yun-fei Li, Qing Liu, Tong Li","doi":"10.1109/EDT.2010.5496553","DOIUrl":null,"url":null,"abstract":"This paper aims at speeding up RSA decryption and signature. The performance of RSA decryption and signature has direct relationship with the efficiency of modular exponentiation implementation. This paper proposes a variant of RSA cryptosystem (EAMRSA-Encrypt Assistant Multi- Prime RSA) by reducing modules and private exponents in modular exponentiation. The experimental result shows that the speed of the decryption and signature has been substantially improved and the variant can be efficiently implemented in parallel.","PeriodicalId":325767,"journal":{"name":"2010 International Conference on E-Health Networking Digital Ecosystems and Technologies (EDT)","volume":"20 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"Design and implementation of an improved RSA algorithm\",\"authors\":\"Yun-fei Li, Qing Liu, Tong Li\",\"doi\":\"10.1109/EDT.2010.5496553\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper aims at speeding up RSA decryption and signature. The performance of RSA decryption and signature has direct relationship with the efficiency of modular exponentiation implementation. This paper proposes a variant of RSA cryptosystem (EAMRSA-Encrypt Assistant Multi- Prime RSA) by reducing modules and private exponents in modular exponentiation. The experimental result shows that the speed of the decryption and signature has been substantially improved and the variant can be efficiently implemented in parallel.\",\"PeriodicalId\":325767,\"journal\":{\"name\":\"2010 International Conference on E-Health Networking Digital Ecosystems and Technologies (EDT)\",\"volume\":\"20 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on E-Health Networking Digital Ecosystems and Technologies (EDT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDT.2010.5496553\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on E-Health Networking Digital Ecosystems and Technologies (EDT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDT.2010.5496553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29

摘要

本文旨在提高RSA解密和签名的速度。RSA解密和签名的性能直接关系到模幂运算的实现效率。本文提出了一种RSA密码系统的变体(eamrsa - encryption Assistant Multi- Prime RSA),该密码系统通过模幂的化简模块和私有指数来实现。实验结果表明,该算法大大提高了解密和签名的速度,并且可以有效地并行实现该算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design and implementation of an improved RSA algorithm
This paper aims at speeding up RSA decryption and signature. The performance of RSA decryption and signature has direct relationship with the efficiency of modular exponentiation implementation. This paper proposes a variant of RSA cryptosystem (EAMRSA-Encrypt Assistant Multi- Prime RSA) by reducing modules and private exponents in modular exponentiation. The experimental result shows that the speed of the decryption and signature has been substantially improved and the variant can be efficiently implemented in parallel.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信