Title: An original data encryption technique for communication networks

Authors: A. Rajasekar; A. Karunakaran; C. Sivakumaran; Sheshang Dipakkumar Degadwala

Addresses: Department of Electronics and Communication Engineering, Dhaanish Ahmed College of Engineering, Chennai, India ' Department of Electronics and Communication Engineering, S.A. Engineering College, Chennai, India ' Photon Technologies, Chennai, India ' Department of Computer and Science Engineering, Sigma Institute of Engineering, Vadodara, Gujarat, India

Abstract: A novel secure distribution technique of network communication data is developed based on data encryption algorithm to address the issues of poor transfer effectiveness and high transmission bit error rate in previous transmission methods. In order to design the cipher text protocol, the access to network communication data is controlled by the agentless key publishing protocol. According to the experimental simulation findings in this work, the SM2 method (Supermemo2) can produce a 256-bit key very rapidly. The research's findings indicate that using link cryptographic algorithms in network communication security can increase security by 25%. The original deep learning chaotic encryption algorithm's performance flaw is optimised in this research. For wireless communication security, a chaotic neural network approach with dynamic keys is suggested. The experimental findings demonstrate that the technique suggested in this study significantly improves the speed of encryption and decryption as well as the key's capacity to resist decoding.

Keywords: neural network; key cryptographic technique; expected release terminal; communication systems; bilinear map-based method; key creation; encryption/decryption algorithms.

DOI: 10.1504/IJESDF.2024.136020

International Journal of Electronic Security and Digital Forensics, 2024 Vol.16 No.1, pp.73 - 83

Received: 13 Jul 2022
Accepted: 27 Oct 2022

Published online: 12 Jan 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article