A File Encryption Algorithm Based on Dynamic Block Out of order Matrix Mapping

Tan Dong, Yanxia Wang, Liu Lei
{"title":"A File Encryption Algorithm Based on Dynamic Block Out of order Matrix Mapping","authors":"Tan Dong, Yanxia Wang, Liu Lei","doi":"10.1109/SPAC46244.2018.8965585","DOIUrl":null,"url":null,"abstract":"In order to solve the security of content transfer during file transfer and fast encryption of large files. This paper proposes a method to quickly encrypt large files and protect the contents of file information, also prevent files from being intercepted and decrypted before use. The algorithm of file encryption based on dynamic block out of order matrix mapping. First, dynamically block the files according to a certain ratio, extract the raw data and key information of each block, then store the out of order data into a two-dimensional table of matrix after calculation and processing. Second, use Base64 encoding on this matrix mapping table. Then the matrix mapping table is to be a unique decryption key of this file. After that, the data in the spare block of the file is filled with the MD5 data, the MD5 data is generated by UUID and block with the same size as the number of dynamic block. The new encrypted file whose length is equal to the original file. Because it is dynamic block and random extracted data, so it is fast and efficient. The experimental results and security analysis show that the algorithm has a good encryption structure and high security, which can effectively resist various attack behaviors. Most of the files that with different types can be used, and the speed to encrypt and decrypt large files is greatly improved compared with the traditional encryption and decryption methods, the speed and efficiency far exceed the traditional file encryption and decryption algorithms, such as AES, DES, 3DES and so on.","PeriodicalId":360369,"journal":{"name":"2018 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAC46244.2018.8965585","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In order to solve the security of content transfer during file transfer and fast encryption of large files. This paper proposes a method to quickly encrypt large files and protect the contents of file information, also prevent files from being intercepted and decrypted before use. The algorithm of file encryption based on dynamic block out of order matrix mapping. First, dynamically block the files according to a certain ratio, extract the raw data and key information of each block, then store the out of order data into a two-dimensional table of matrix after calculation and processing. Second, use Base64 encoding on this matrix mapping table. Then the matrix mapping table is to be a unique decryption key of this file. After that, the data in the spare block of the file is filled with the MD5 data, the MD5 data is generated by UUID and block with the same size as the number of dynamic block. The new encrypted file whose length is equal to the original file. Because it is dynamic block and random extracted data, so it is fast and efficient. The experimental results and security analysis show that the algorithm has a good encryption structure and high security, which can effectively resist various attack behaviors. Most of the files that with different types can be used, and the speed to encrypt and decrypt large files is greatly improved compared with the traditional encryption and decryption methods, the speed and efficiency far exceed the traditional file encryption and decryption algorithms, such as AES, DES, 3DES and so on.
基于动态块乱序矩阵映射的文件加密算法
为了解决文件传输过程中内容传输的安全性和大文件的快速加密问题。本文提出了一种对大文件进行快速加密,保护文件信息内容,防止文件在使用前被拦截和解密的方法。基于动态块乱序矩阵映射的文件加密算法。首先按照一定的比例对文件进行动态分块,提取每个分块的原始数据和关键信息,然后将乱序数据经过计算处理后存储到二维矩阵表中。其次,在这个矩阵映射表上使用Base64编码。那么矩阵映射表将作为该文件的唯一解密密钥。之后,在文件的备用块中填充MD5数据,MD5数据由UUID和与动态块数相同大小的块生成。与原文件长度相等的新加密文件。由于它是动态块和随机提取的数据,所以速度快,效率高。实验结果和安全性分析表明,该算法具有良好的加密结构和较高的安全性,能够有效抵御各种攻击行为。大多数不同类型的文件都可以使用,并且对大型文件的加解密速度与传统的加解密方法相比有了很大的提高,速度和效率远远超过传统的文件加解密算法,如AES、DES、3DES等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信