利用随机森林数据挖掘算法生成流密码系统密钥的新方法

Samaher Hussein Ali
{"title":"利用随机森林数据挖掘算法生成流密码系统密钥的新方法","authors":"Samaher Hussein Ali","doi":"10.1109/DeSE.2013.54","DOIUrl":null,"url":null,"abstract":"Key generator is part of the stream cipher system that is responsible for generating a long random sequence of binary bits key that used in ciphering and deciphering processes. Therefore, key generator is the heart of the stream cipher system. A system with traditional key generating techniques such as using the feedback shift register is vulnerable to cypher attacks which render it to be ineffective and insecure. A suggested novel method to overcome this problem is to use a Random Forest-Data Mining (RF-DM) algorithm. It incorporates using new types of linear and nonlinear functions to mix the plain text with the key in the encryption process and the cipher text with the reverse key in the decryption process. The method is successful in satisfying the secrecy goal of the stream cipher system because it uses two types of dual randomization to baffle the attacker or cryptanalysist. By mathematical logic and prove by experiments, we generate the key successfully by encrypting messages of different sizes . This proves the ablity to generated the unique key for each message based on its length without repeating the key in most cases. In addition, by combining the use of the random forest data mining technique as the randomizating principle in the ciperhing process makes it exteremely difficult for any attacker because the attacker does not have access or understanding of the not only the technique used but also the process to decipher. The result from our experiment shows that the longer the number of the message size, the longer is the length of the generated key, which determines its strength and hence, its complexity to break by brute force.","PeriodicalId":248716,"journal":{"name":"2013 Sixth International Conference on Developments in eSystems Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"36","resultStr":"{\"title\":\"Novel Approach for Generating the Key of Stream Cipher System Using Random Forest Data Mining Algorithm\",\"authors\":\"Samaher Hussein Ali\",\"doi\":\"10.1109/DeSE.2013.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Key generator is part of the stream cipher system that is responsible for generating a long random sequence of binary bits key that used in ciphering and deciphering processes. Therefore, key generator is the heart of the stream cipher system. A system with traditional key generating techniques such as using the feedback shift register is vulnerable to cypher attacks which render it to be ineffective and insecure. A suggested novel method to overcome this problem is to use a Random Forest-Data Mining (RF-DM) algorithm. It incorporates using new types of linear and nonlinear functions to mix the plain text with the key in the encryption process and the cipher text with the reverse key in the decryption process. The method is successful in satisfying the secrecy goal of the stream cipher system because it uses two types of dual randomization to baffle the attacker or cryptanalysist. By mathematical logic and prove by experiments, we generate the key successfully by encrypting messages of different sizes . This proves the ablity to generated the unique key for each message based on its length without repeating the key in most cases. In addition, by combining the use of the random forest data mining technique as the randomizating principle in the ciperhing process makes it exteremely difficult for any attacker because the attacker does not have access or understanding of the not only the technique used but also the process to decipher. The result from our experiment shows that the longer the number of the message size, the longer is the length of the generated key, which determines its strength and hence, its complexity to break by brute force.\",\"PeriodicalId\":248716,\"journal\":{\"name\":\"2013 Sixth International Conference on Developments in eSystems Engineering\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"36\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Sixth International Conference on Developments in eSystems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DeSE.2013.54\",\"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 Sixth International Conference on Developments in eSystems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DeSE.2013.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 36

摘要

密钥生成器是流密码系统的一部分,负责生成用于加密和解密过程的长随机二进制位密钥序列。因此,密钥生成器是流密码系统的核心。使用反馈移位寄存器等传统密钥生成技术的系统容易受到密码攻击,使其无效且不安全。一种克服这一问题的新方法是使用随机森林数据挖掘(RF-DM)算法。它结合了使用新型的线性和非线性函数,在加密过程中将明文与密钥混合,在解密过程中将密文与反向密钥混合。该方法利用两种类型的双随机化来迷惑攻击者或密码分析者,成功地满足了流密码系统的保密目标。通过数学逻辑和实验证明,我们通过对不同大小的消息进行加密,成功地生成了密钥。这证明了在大多数情况下,可以根据每个消息的长度为其生成唯一密钥,而无需重复密钥。此外,结合使用随机森林数据挖掘技术作为加密过程中的随机化原理,使得任何攻击者都非常困难,因为攻击者不仅无法访问或理解所使用的技术,而且无法理解解密过程。我们的实验结果表明,消息大小的数字越长,生成的密钥的长度就越长,这决定了它的强度,因此,它被暴力破解的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Novel Approach for Generating the Key of Stream Cipher System Using Random Forest Data Mining Algorithm
Key generator is part of the stream cipher system that is responsible for generating a long random sequence of binary bits key that used in ciphering and deciphering processes. Therefore, key generator is the heart of the stream cipher system. A system with traditional key generating techniques such as using the feedback shift register is vulnerable to cypher attacks which render it to be ineffective and insecure. A suggested novel method to overcome this problem is to use a Random Forest-Data Mining (RF-DM) algorithm. It incorporates using new types of linear and nonlinear functions to mix the plain text with the key in the encryption process and the cipher text with the reverse key in the decryption process. The method is successful in satisfying the secrecy goal of the stream cipher system because it uses two types of dual randomization to baffle the attacker or cryptanalysist. By mathematical logic and prove by experiments, we generate the key successfully by encrypting messages of different sizes . This proves the ablity to generated the unique key for each message based on its length without repeating the key in most cases. In addition, by combining the use of the random forest data mining technique as the randomizating principle in the ciperhing process makes it exteremely difficult for any attacker because the attacker does not have access or understanding of the not only the technique used but also the process to decipher. The result from our experiment shows that the longer the number of the message size, the longer is the length of the generated key, which determines its strength and hence, its complexity to break by brute force.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信