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}
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.