加密算法采用对偶模

Manu, Aarti Goel
{"title":"加密算法采用对偶模","authors":"Manu, Aarti Goel","doi":"10.1109/CIACT.2017.7977331","DOIUrl":null,"url":null,"abstract":"Dual modulus play important role in increasing the complexity of decomposing values into factors as compared to single modulus. This paper is based on RSA algorithm. Proposed encryption algorithm is more secure as compared to RSA algorithm since it uses dual modulus. This algorithm uses double encryption and decryption using double private and public keys to provide security against Brute-force attacks. Therefore, if an intruder detects a single key of cryptosystem even then it is not possible to decrypt the message. The basic motivation behind this paper is that in conventional RSA algorithm if we can factor modulus (n) into its prime numbers then we can generate private key. So in order to remove this weakness we can use dual modulus and improve the security of the system substantially.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Encryption algorithm using dual modulus\",\"authors\":\"Manu, Aarti Goel\",\"doi\":\"10.1109/CIACT.2017.7977331\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dual modulus play important role in increasing the complexity of decomposing values into factors as compared to single modulus. This paper is based on RSA algorithm. Proposed encryption algorithm is more secure as compared to RSA algorithm since it uses dual modulus. This algorithm uses double encryption and decryption using double private and public keys to provide security against Brute-force attacks. Therefore, if an intruder detects a single key of cryptosystem even then it is not possible to decrypt the message. The basic motivation behind this paper is that in conventional RSA algorithm if we can factor modulus (n) into its prime numbers then we can generate private key. So in order to remove this weakness we can use dual modulus and improve the security of the system substantially.\",\"PeriodicalId\":218079,\"journal\":{\"name\":\"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIACT.2017.7977331\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIACT.2017.7977331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

与单模相比,双模在增加分解因子的复杂性方面发挥了重要作用。本文是基于RSA算法的。所提出的加密算法由于使用了对偶模,因此与RSA算法相比具有更高的安全性。该算法使用双私钥和双公钥进行双重加密和解密,以防止暴力攻击。因此,如果入侵者检测到密码系统的单个密钥,则不可能解密消息。本文背后的基本动机是,在传统的RSA算法中,如果我们可以将模数(n)分解成它的素数,那么我们就可以生成私钥。为了克服这一弱点,我们可以采用对偶模,大大提高系统的安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Encryption algorithm using dual modulus
Dual modulus play important role in increasing the complexity of decomposing values into factors as compared to single modulus. This paper is based on RSA algorithm. Proposed encryption algorithm is more secure as compared to RSA algorithm since it uses dual modulus. This algorithm uses double encryption and decryption using double private and public keys to provide security against Brute-force attacks. Therefore, if an intruder detects a single key of cryptosystem even then it is not possible to decrypt the message. The basic motivation behind this paper is that in conventional RSA algorithm if we can factor modulus (n) into its prime numbers then we can generate private key. So in order to remove this weakness we can use dual modulus and improve the security of the system substantially.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信