# A Finite State Machine-Based Improved Cryptographic Technique
## 3 Proposed Methodology  
The classic method accomplishes security and reliability via a cascade implementation of the traditional cryptography system and the error-correcting coding scheme. To ensure the safety of the sent data, it is first encrypted and then the transmission channels are encoded. Information received must be decoded and encrypted at the receiving end before it can be used to reconstruct the original message. The Advanced Encryption Standard (AES) is an algorithm for secure data transmission that has been recommended for use. \begin{table}
\begin{tabular}{l l l} \hline \hline \multicolumn{1}{c}{**Reference**} & \multicolumn{1}{c}{**Methodology**} & \multicolumn{1}{c}{**Demerits**} \\ \hline [22] & RDH-ED scheme & Less accuracy. \\ \hline [23] & RDH encryption algorithm & Low accuracy rate and high error rate. \\ \hline [24] & Image encryption based on block-based confusion and multiple levels of diffusion & Different image data type, compliance of NIST, and robustness are not considered. \\ \hline [25] & Encrypting images using the chaotic PWLCM system and the Game of Life permutation & Non-compliance with pseudorandom chaotic sequences; lack of resilience to data loss or noise. \\ \hline [26] & A novel picture encryption technique based on a hyper-chaotic map & Requirement to raise the security level and resilience against loss of data and noise is not considered. \\ \hline [27] & Selective picture encryption that works well & Time savings and noise resistance are both improved, but security must be tightened. Lack of adherence to NIST standards. \\ \hline [28] & The use of a chaotic map and DNA complementary principles to create a noise-resistant, selective picture encryption for grayscale photos. & Possibility of sharing up security by taking any and all photos into account. \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Cont. For the goal of data security, it is often used in systems with constrained means, such as satellites. The performance of a convolution coding unit connected in parallel mode can be assessed from the Input Redundancy Weight Enumerating Function (IRWEF) of the converged constituent recursive convolution code \(C\) as given by  
\[A^{c}(W,Z)=\sum_{w}\sum_{Z}A^{c}_{w,Z}W^{w}Z^{z} \tag{1}\]  
where the coefficient \(A^{C}_{w,t}\) implies the coded strings number-devising parity check weight spawned by an input bit stream of weight \(w\). Here, \(W\) and \(Z\) suggest two dummy variables. The Conditional Weight Enumerating Functions (CWEFs) \(A_{w,C_{1}}(w,Z)\) and \(A_{w,C_{2}}(w,Z)\) of the encoding modules \(C_{1}\) and \(C_{2}\) can be specified in Equation (2) and Equation (3), respectively. \[A_{w,C_{1}}(w,Z)=\sum_{z}A^{C_{1}}_{w,Z}Z^{z} \tag{2}\]  
\[A_{w,C_{2}}(w,Z)=\sum_{z}A^{C_{2}}_{w}Z^{z} \tag{3}\]  
Here, \(A^{C_{1}}_{w,z}\) and \(A^{C_{2}}_{w,z}\) signify the coefficients of the weight enumerating function of the encoding modules \(C_{1}\) and \(C_{2}\), respectively. These coefficients denote coded strings with parity check weight \(z\) produced by input bit string of weight \(w\). Now, by picking up the appropriate value of \(\lambda\) which is the input factor and N is the pixel range, the fractional part of the parity sequences of length \(\lambda N\) and \(\lambda K\) from \(C_{1}\) and \(C_{2}\) are amassed by a P/S multiplexing unit to create the coded bit sequence of length \(\lambda(N+K)\). Therefore, the CWEF [17] of the multiplexing unit which accrues the fractional sequence approaching from convolution encoders connected in a parallel fashion and detached by an interleaver of size \(l_{1}\) is specified by:  
\[P_{w,A_{2}(w5,Z)}=\frac{A_{w,C_{1}}(w_{6},Z)^{*}A_{w,C_{2}}(w_{5},Z)\text{N}}{ \left( \begin{array}{c}l_{1}\\ w\end{array} \right)*\lambda} \tag{4}\]  
The authenticity of Equation (4) has been assessed by considering the following norm: It states that the interleaver \(\pi_{1}\) of length \(l_{1}\) should map a set of incoming bits of weight \(w\) into all of its dissimilar \(P\) permutation with identical probability \(\left(