Persamaan Lorenz untuk Keamanan Nomor Serial Sistem Operasi Window7

Dewanto Harwin Rohan, Nur Hayati
{"title":"Persamaan Lorenz untuk Keamanan Nomor Serial Sistem Operasi Window7","authors":"Dewanto Harwin Rohan, Nur Hayati","doi":"10.22441/FIFO.2018.V10I2.001","DOIUrl":null,"url":null,"abstract":"Serial number of operating system windows 7 needs to be safeguarded, so can’t be used by the others. Security of the data can use by modern cryptography such as Vernam Cipher methods and classic cryptography such as Caesar Cipher methods. The security level both of this method depends on the keywords used and it will difficult to crack if the random key is used more and more. To get a random key, we can take from chaos of Lorenz equations as key-generator for encryption and description. Before utilizing chaos in the Lorenz equations, we have to find the maximum t (time) for the inverse problem solution to fit with the forward problem solution. We can use Runge-Kutta method in the Lorenz equations for forward problem solution and inverse problem solution. The solution of integral that obtained by the Runge-Kutta method can be searched by Trapezoidal method. The result of Runge-Kutta solution and Trapezoidal will be used as key-generator for encryption and description. In the simulations performed, the best orde in Runge-Kutta method is 4 and t max is 2. The encryption key is used as the initial condition of Lorenz equation, then the result is integrable by the Trapezoidal method. The result of orde 4 from Runge-Kutta method and Trapezoidal method used as a key-generator.  Application of Lorenz equation as key-generator for encryption and decryption, may change the cryptography algorithms of symmetric to be asymmetric.","PeriodicalId":280491,"journal":{"name":"Jurnal Ilmiah FIFO","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Ilmiah FIFO","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22441/FIFO.2018.V10I2.001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Serial number of operating system windows 7 needs to be safeguarded, so can’t be used by the others. Security of the data can use by modern cryptography such as Vernam Cipher methods and classic cryptography such as Caesar Cipher methods. The security level both of this method depends on the keywords used and it will difficult to crack if the random key is used more and more. To get a random key, we can take from chaos of Lorenz equations as key-generator for encryption and description. Before utilizing chaos in the Lorenz equations, we have to find the maximum t (time) for the inverse problem solution to fit with the forward problem solution. We can use Runge-Kutta method in the Lorenz equations for forward problem solution and inverse problem solution. The solution of integral that obtained by the Runge-Kutta method can be searched by Trapezoidal method. The result of Runge-Kutta solution and Trapezoidal will be used as key-generator for encryption and description. In the simulations performed, the best orde in Runge-Kutta method is 4 and t max is 2. The encryption key is used as the initial condition of Lorenz equation, then the result is integrable by the Trapezoidal method. The result of orde 4 from Runge-Kutta method and Trapezoidal method used as a key-generator.  Application of Lorenz equation as key-generator for encryption and decryption, may change the cryptography algorithms of symmetric to be asymmetric.
Window7操作系统序列号Lorenz方程
操作系统windows7的序列号需要保护,所以不能被其他人使用。数据的安全性可以采用现代密码学方法,如维尔南密码方法和经典密码学方法,如凯撒密码方法。这两种方法的安全级别都取决于所使用的关键字,如果随机密钥的使用越来越多,将很难被破解。为了得到一个随机密钥,我们可以从混沌的洛伦兹方程中提取密钥生成器来进行加密和描述。在Lorenz方程中使用混沌之前,我们必须找到逆问题解与正问题解拟合的最大t(时间)。我们可以用龙格-库塔法求解洛伦兹方程的正解和逆解。用龙格-库塔法求出的积分解可以用梯形法求出。龙格-库塔解和梯形的结果将作为密钥生成器用于加密和描述。仿真结果表明,龙格-库塔方法的最佳阶数为4,最大阶数为2。将加密密钥作为洛伦兹方程的初始条件,用梯形法对结果进行积分。用龙格-库塔法和梯形法得到的4阶结果作为密钥生成器。将洛伦兹方程作为密钥生成器用于加密和解密,可能会使对称加密算法变为非对称加密算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信