Hiring in life sciences? Share your open positions with our professional community. Read more Close

Advertisement

Dual chaotic encryption method for wireless communication privacy data based on deep learning.

Created on 24 Jun 2026

Authors

Hongbo Yu

Published in

PloS one. Volume 21. Issue 6. Pages e0341253. Epub Jun 23, 2026.

Abstract

In wireless communication, the multipath effect and the time-varying channel due to mobility will directly lead to the key update cycle lagging far behind the channel change, which is difficult to effectively resist various malicious attacks and stealing behaviors, and affects the effect of privacy data protection in wireless communication. To this end, a deep learning-based dual chaos encryption method is proposed for wireless communication privacy data. Combining the chaotic characteristics of one-dimensional Logistic mapping and two-dimensional Henon mapping, the dual chaotic key is generated to extend the key space and improve the anti-attack ability; and the bidirectional long and short-term memory network (BiLSTM) is used to analyze the data such as key usage records, accurately predict the timing of the key updating, and generate a new key when anomalies are detected, and then distribute it securely. Taking the updated double chaotic key as input, the AES algorithm is used to realize wireless communication privacy data encryption through key expansion, initial round encryption, multiple rounds of iterative encryption and final round encryption, while the decryption process restores the plaintext by inverse operation. Experiments demonstrate that the method can effectively realize wireless communication privacy data encryption, and the security index can reach more than 0.94 in the face of different types of network attacks. It demonstrates that the proposed method can have the ability to resist all kinds of attacks and protect the security of private data.

PMID:
42335192
Bibliographic data and abstract were imported from PubMed on 24 Jun 2026.

Read full publication at:
Please sign in to see all details.

Advertisement

Stats

  • Community rating n/a 0 votes
  • Reviewers' rating n/a 0 votes
  • Your rating

1-terrible, 9-excellent. How would you rate this publication? Sign in in to submit your rating.

  • Recommendations n/a n/a positive of 0 vote(s)
  • Views 2
  • Comments 0

Recommended by

  • No recommendations yet.

Post a comment

You need to be signed in to post comments. You can sign in here.

Comments

There are no comments yet.

Advertisement