基于一维Logistic映射和二维Tent映射双混沌思路的网络信息加密
DOI:
作者:
作者单位:

解放军总医院医疗保障中心信息科

作者简介:

通讯作者:

中图分类号:

TP309.7??

基金项目:


Network information encryption based on one-dimensional Logistic mapping and two-dimensional Tent mapping
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    网络信息传输过程一旦出现波动,其加密和解密时间过长,使其传输负载超出最佳范围。本文设计一种基于一维Logistic映射和二维Tent映射双混沌思路的网络信息加密方法。先采用时间序列分析的方式完成网络稳定性分析:每个网络信息特征序列都会随着时间的变化而变化。可依据网络传输时间序列图识别网络的稳定性;然后根据其时间序列的稳定性分析结果,计算网络传输的时间序列偏离度,结合偏离度参数利用双混沌互反馈安全加密方法实现网络数据加密,实验结果表明:与对比方法相比,所提方法加解密时间较短,且传输负载均在最佳负载范围内,验证了该方法的可靠性强、安全性高。

    Abstract:

    Once the network information transmission process fluctuates, its encryption and decryption time is too long, making its transmission load beyond the optimal range. This paper designs a network information encryption method based on the idea of dual chaos of one-dimensional Logistic map and two-dimensional Tent map. First, we use time series analysis to complete the network stability analysis: each network information feature sequence will change with time. The stability of the network can be identified according to the network transmission time sequence diagram; Then, according to the stability analysis results of its time series, the deviation degree of the time series transmitted on the network is calculated. Combined with the deviation degree parameters, the network data encryption is realized by using the double chaos mutual feedback security encryption method. The experimental results show that compared with the comparison method, the encryption and decryption time of the proposed method is shorter, and the transmission load is within the optimal load range, which verifies that the method has strong reliability and high security.

    参考文献
    相似文献
    引证文献
引用本文

田如意,顾风军,彭坤,国栩.基于一维Logistic映射和二维Tent映射双混沌思路的网络信息加密计算机测量与控制[J].,2023,31(6):280-296.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2022-12-23
  • 最后修改日期:2023-02-10
  • 录用日期:2023-02-10
  • 在线发布日期: 2023-06-15
  • 出版日期:
文章二维码