X-MODDES(基于扩展多操作符分隔符的数据加密标准)

P. Gope, A. Kaushik, Kushal Arora, N. Kumar
{"title":"X-MODDES(基于扩展多操作符分隔符的数据加密标准)","authors":"P. Gope, A. Kaushik, Kushal Arora, N. Kumar","doi":"10.1109/ICFN.2010.67","DOIUrl":null,"url":null,"abstract":"An Algorithm is considered computationally secure if it can not be broken with standard resources, either current or future. In this paper we have introduced a new block cipher algorithm named X-MODDES. It is unique independent approach which uses several computational steps along with string of operators and randomized delimiter selections by using some suitable mathematical logic. X-MODDES is specially designed to produce different cipher texts by applying same key on same plain text. Thus a new protocol has been designed to encrypt a given text, which allows a higher level security as compare to MODDES. The Algorithm is successfully implemented on text file, corresponding digital image file and audio file. Here we have also tried to highlight the performance of some well known data algorithms like DES, Triple-DES, AES (Rijndael), MODDES, and compare them with the X-MODDES. Finally it has been proved that X-MODDES is one of the best performing partial symmetric key algorithm among the above mention algorithms particularly for the text message with limited size.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"X-MODDES (eXtended Multi Operator Delimiter Based Data Encryption Standard)\",\"authors\":\"P. Gope, A. Kaushik, Kushal Arora, N. Kumar\",\"doi\":\"10.1109/ICFN.2010.67\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An Algorithm is considered computationally secure if it can not be broken with standard resources, either current or future. In this paper we have introduced a new block cipher algorithm named X-MODDES. It is unique independent approach which uses several computational steps along with string of operators and randomized delimiter selections by using some suitable mathematical logic. X-MODDES is specially designed to produce different cipher texts by applying same key on same plain text. Thus a new protocol has been designed to encrypt a given text, which allows a higher level security as compare to MODDES. The Algorithm is successfully implemented on text file, corresponding digital image file and audio file. Here we have also tried to highlight the performance of some well known data algorithms like DES, Triple-DES, AES (Rijndael), MODDES, and compare them with the X-MODDES. Finally it has been proved that X-MODDES is one of the best performing partial symmetric key algorithm among the above mention algorithms particularly for the text message with limited size.\",\"PeriodicalId\":185491,\"journal\":{\"name\":\"2010 Second International Conference on Future Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-01-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Future Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFN.2010.67\",\"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 Second International Conference on Future Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFN.2010.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

如果一个算法不能被当前或将来的标准资源破坏,那么它就被认为是计算安全的。本文介绍了一种新的分组密码算法X-MODDES。它是一种独特的独立方法,通过使用一些合适的数学逻辑,使用多个计算步骤以及字符串运算符和随机分隔符选择。X-MODDES是专门设计的,通过在相同的明文上应用相同的密钥来产生不同的密文。因此,设计了一个新的协议来加密给定的文本,与MODDES相比,它允许更高级别的安全性。该算法在文本文件、相应的数字图像文件和音频文件上成功实现。在这里,我们还试图强调一些众所周知的数据算法的性能,如DES, Triple-DES, AES (Rijndael), MODDES,并将它们与X-MODDES进行比较。最后证明了X-MODDES是上述算法中性能最好的部分对称密钥算法之一,特别是对于有限大小的短信。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
X-MODDES (eXtended Multi Operator Delimiter Based Data Encryption Standard)
An Algorithm is considered computationally secure if it can not be broken with standard resources, either current or future. In this paper we have introduced a new block cipher algorithm named X-MODDES. It is unique independent approach which uses several computational steps along with string of operators and randomized delimiter selections by using some suitable mathematical logic. X-MODDES is specially designed to produce different cipher texts by applying same key on same plain text. Thus a new protocol has been designed to encrypt a given text, which allows a higher level security as compare to MODDES. The Algorithm is successfully implemented on text file, corresponding digital image file and audio file. Here we have also tried to highlight the performance of some well known data algorithms like DES, Triple-DES, AES (Rijndael), MODDES, and compare them with the X-MODDES. Finally it has been proved that X-MODDES is one of the best performing partial symmetric key algorithm among the above mention algorithms particularly for the text message with limited size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信