一种对称密码算法的设计与性能分析

B. Mandal, D. Bhattacharyya, Samir Kumar Bandyopadhyay
{"title":"一种对称密码算法的设计与性能分析","authors":"B. Mandal, D. Bhattacharyya, Samir Kumar Bandyopadhyay","doi":"10.1109/CSNT.2013.101","DOIUrl":null,"url":null,"abstract":"We design an algorithm to merge both RSA algorithm and Diffie-Hellman Algorithm of them to provide a user with even higher level of data security. Actually, our intent is to secure data of smaller as well as larger size by obtaining one randomly chosen key pair from set of RSA keys and one randomly chosen secret key using Diffie-Hellman algorithm and then applying RSA encryption to make even public components of Diffie-Hellman algorithm inaccessible for any eavesdropper freely. Encrypted exchange of public components of Diffie-Hellman part of the system makes it hidden from all other than intended users to see Diffie-Hellman generator and prime modulus. This will make our algorithm M*N times complex to break using even the latest version of Brute Force attack, where M and N are corresponding complexities imposed by the Diffie-Hellman and RSA algorithms respectively. Encryption algorithms play a main role in information security systems. On the other side, those algorithms consume a significant amount of computing resources such as CPU time, memory, and battery power. This paper provides evaluation of five of the most common encryption algorithms namely: AES (Rijndael), DES, 3DES, RC2, Blowfish. A comparison has been conducted with our proposed algorithm.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Designing and Performance Analysis of a Proposed Symmetric Cryptography Algorithm\",\"authors\":\"B. Mandal, D. Bhattacharyya, Samir Kumar Bandyopadhyay\",\"doi\":\"10.1109/CSNT.2013.101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We design an algorithm to merge both RSA algorithm and Diffie-Hellman Algorithm of them to provide a user with even higher level of data security. Actually, our intent is to secure data of smaller as well as larger size by obtaining one randomly chosen key pair from set of RSA keys and one randomly chosen secret key using Diffie-Hellman algorithm and then applying RSA encryption to make even public components of Diffie-Hellman algorithm inaccessible for any eavesdropper freely. Encrypted exchange of public components of Diffie-Hellman part of the system makes it hidden from all other than intended users to see Diffie-Hellman generator and prime modulus. This will make our algorithm M*N times complex to break using even the latest version of Brute Force attack, where M and N are corresponding complexities imposed by the Diffie-Hellman and RSA algorithms respectively. Encryption algorithms play a main role in information security systems. On the other side, those algorithms consume a significant amount of computing resources such as CPU time, memory, and battery power. This paper provides evaluation of five of the most common encryption algorithms namely: AES (Rijndael), DES, 3DES, RC2, Blowfish. A comparison has been conducted with our proposed algorithm.\",\"PeriodicalId\":111865,\"journal\":{\"name\":\"2013 International Conference on Communication Systems and Network Technologies\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Communication Systems and Network Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSNT.2013.101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Communication Systems and Network Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNT.2013.101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

我们设计了一种融合RSA算法和Diffie-Hellman算法的算法,为用户提供更高级别的数据安全性。实际上,我们的目的是通过使用Diffie-Hellman算法从一组RSA密钥中随机选择一个密钥对和一个随机选择的秘密密钥,然后使用RSA加密,使任何窃听者都可以自由地访问Diffie-Hellman算法的公共组件,从而保护更小和更大的数据。对系统中Diffie-Hellman部分的公共组件进行加密交换,使其对除预期用户之外的所有人隐藏,无法看到Diffie-Hellman生成器和素数模。这将使我们的算法复杂到M*N倍,即使使用最新版本的蛮力攻击也无法破解,其中M和N分别是由Diffie-Hellman和RSA算法施加的相应复杂性。加密算法在信息安全系统中起着重要的作用。另一方面,这些算法消耗了大量的计算资源,如CPU时间、内存和电池电量。本文对AES (Rijndael)、DES、3DES、RC2、Blowfish等五种最常用的加密算法进行了评价。并与我们提出的算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Designing and Performance Analysis of a Proposed Symmetric Cryptography Algorithm
We design an algorithm to merge both RSA algorithm and Diffie-Hellman Algorithm of them to provide a user with even higher level of data security. Actually, our intent is to secure data of smaller as well as larger size by obtaining one randomly chosen key pair from set of RSA keys and one randomly chosen secret key using Diffie-Hellman algorithm and then applying RSA encryption to make even public components of Diffie-Hellman algorithm inaccessible for any eavesdropper freely. Encrypted exchange of public components of Diffie-Hellman part of the system makes it hidden from all other than intended users to see Diffie-Hellman generator and prime modulus. This will make our algorithm M*N times complex to break using even the latest version of Brute Force attack, where M and N are corresponding complexities imposed by the Diffie-Hellman and RSA algorithms respectively. Encryption algorithms play a main role in information security systems. On the other side, those algorithms consume a significant amount of computing resources such as CPU time, memory, and battery power. This paper provides evaluation of five of the most common encryption algorithms namely: AES (Rijndael), DES, 3DES, RC2, Blowfish. A comparison has been conducted with our proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信