检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:邹静[1] 黄颖[2] 李娟 ZOU Jing;HUANG Ying;LI Juan(School of Information Engineering,Wuchang Institute of Technology,Wuhan Hubei 430065,China;School of Electronic Engineering,Naval University of Engineering,Wuhan Hubei 430033,China)
机构地区:[1]武昌工学院信息工程学院,湖北武汉430065 [2]海军工程大学电子工程学院,湖北武汉430033
出 处:《计算机仿真》2024年第11期432-436,共5页Computer Simulation
基 金:2019年度湖北省教育厅科学研究计划指导性项目(B2019296)。
摘 要:为了保证数据完整性和可靠性,会多次对数据收集和存储,导致同一数据被重复存储,增加了冗余度,使得对基站数据加密变得困难。为了解决上述问题,提出移动网络基站大数据无监督抗破译加密方法,通过建立无监督数据消冗算法,对于相同数据采用变长分块识别方法识别并删除重复数据,对于相似数据利用布隆过滤器算法识别并删除相似数据,降低数据冗余度。结合Logistic映射和Henon映射生成双混沌序列,将所得双混沌序列作为高级加密标准(Advanced Encryption Standard,AES)算法的加密密钥,以此实现移动网络基站大数据无监督抗破译加密。实验结果表明,所提方法加密、解密延时均低于12ms,且吞吐量高。To ensure data integrity and reliability,it is necessary to collect and store data for many times,which increases data redundancy and difficulty in encrypting base station data.In order to solve this problem,an unsuper-vised encryption method for big data of mobile network base stations was presented.Firstly,an unsupervised redun-dancy elimination algorithm was designed.For the same data,variable-sized partition method was used to identify and delete duplicate data.For similar data,Bloom filter was used to identify and delete similar data,thus reducing data re-dundancy.Logistic mapping was combined with Henon mapping to form a double chaotic sequence as the encryption key of Advanced Encryption Standard(AES)algorithm.Finally,the unsupervised encryption of big data in mobile net-work base station was achieved.The experimental results show that the time delay of encryption and decryption of the proposed method is less than 12ms,and the throughput is high.
关 键 词:移动网络基站大数据 无监督 抗破译 数据消冗 混沌加密
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7