数据加密标准算法(DES)的改进

Nadia Mustafa Mohammed Alhag, Y. Mohamed
{"title":"数据加密标准算法(DES)的改进","authors":"Nadia Mustafa Mohammed Alhag, Y. Mohamed","doi":"10.1109/ICCCEEE.2018.8515843","DOIUrl":null,"url":null,"abstract":"The Data Encryption Standard (DES) algorithm has been considered as the most popular symmetric key, blocks ciphering cryptographic. Even though the DES algorithm had still been used in some applications, it was considered unsafe because of the short key length (64 Bits), besides, the Brute force attack has shown that the DES practically can be attacked. In January 1999, the DES key was cracked in only (22 hours) and (15 minutes). The aim of this research is to improve the DES algorithm by increasing the key length (1024 bits) that is to be divided into 16 keys (64 bits each), each key is independently generated for the different algorithm cycles. The results of the proposed algorithm were much better than the old algorithm for detecting the encryption key or the total number of keys that could be generated by following Blind search method (try all possible keys), Increasing the key length (degree of complexity) makes it difficult to search in a vast space of numbers and attempts.","PeriodicalId":6567,"journal":{"name":"2018 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE)","volume":"23 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An Enhancement of Data Encryption Standards Algorithm (DES)\",\"authors\":\"Nadia Mustafa Mohammed Alhag, Y. Mohamed\",\"doi\":\"10.1109/ICCCEEE.2018.8515843\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Data Encryption Standard (DES) algorithm has been considered as the most popular symmetric key, blocks ciphering cryptographic. Even though the DES algorithm had still been used in some applications, it was considered unsafe because of the short key length (64 Bits), besides, the Brute force attack has shown that the DES practically can be attacked. In January 1999, the DES key was cracked in only (22 hours) and (15 minutes). The aim of this research is to improve the DES algorithm by increasing the key length (1024 bits) that is to be divided into 16 keys (64 bits each), each key is independently generated for the different algorithm cycles. The results of the proposed algorithm were much better than the old algorithm for detecting the encryption key or the total number of keys that could be generated by following Blind search method (try all possible keys), Increasing the key length (degree of complexity) makes it difficult to search in a vast space of numbers and attempts.\",\"PeriodicalId\":6567,\"journal\":{\"name\":\"2018 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE)\",\"volume\":\"23 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCEEE.2018.8515843\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCEEE.2018.8515843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

数据加密标准(DES)算法一直被认为是目前最流行的对称密钥算法,用于分组加密。尽管DES算法仍然在一些应用中使用,但由于密钥长度短(64位),它被认为是不安全的,而且暴力破解攻击表明DES实际上是可以被攻击的。1999年1月,DES密钥仅在(22小时)和(15分钟)内被破解。本研究的目的是通过增加密钥长度(1024位)来改进DES算法,将密钥长度分成16个密钥(每个密钥64位),每个密钥是针对不同的算法周期独立生成的。在检测加密密钥或采用盲搜索法(尝试所有可能的密钥)可以生成的密钥总数时,本文算法的结果比旧算法好得多,增加了密钥长度(复杂度),使得在大量的数字和尝试空间中搜索变得困难。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Enhancement of Data Encryption Standards Algorithm (DES)
The Data Encryption Standard (DES) algorithm has been considered as the most popular symmetric key, blocks ciphering cryptographic. Even though the DES algorithm had still been used in some applications, it was considered unsafe because of the short key length (64 Bits), besides, the Brute force attack has shown that the DES practically can be attacked. In January 1999, the DES key was cracked in only (22 hours) and (15 minutes). The aim of this research is to improve the DES algorithm by increasing the key length (1024 bits) that is to be divided into 16 keys (64 bits each), each key is independently generated for the different algorithm cycles. The results of the proposed algorithm were much better than the old algorithm for detecting the encryption key or the total number of keys that could be generated by following Blind search method (try all possible keys), Increasing the key length (degree of complexity) makes it difficult to search in a vast space of numbers and attempts.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance Evaluation of AODV, OLSR and GRP Routing Protocols in Vehicular Highway Environment Performance Evaluation and Failure Analysis of Modular Power Amplifier with Gysel and Branch Coupler Network Efftciency Analysis ofLighting Bulbs Using Fuzzy Data Envelopment Analysis Vehicles Distribution and Lines Planning in Public Transportation A case Study: Wad Medani, Gezira State, Sudan Mobile based Tele-medicine Diabetic Retinopathy Screening
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1