# A Finite State Machine-Based Improved Cryptographic Technique
## 6 Limitations and Future Work  
The suggested methods' high operational complexity has two advantages: increased security and less time spent on encryption and decryption. A more likely outcome of a successful cryptanalysis was achieved by using an intermediate cypher. As can be seen from the above, not only do the suggested algorithms improve security, they also provide more robust security than the current methods. It has been shown that the suggested algorithms offer higher throughput than other encryption methods. It is also easy to show that our algorithms are safer than others due to the reduced likelihood of different assaults.  
We combine mathematical techniques with those from the finite field GF(2 7) to arrive at our conclusions. Prospective research has the potential to extend these findings beyond GF(2 n) and GF(3 n). Future work may expand these parameters to provide even more secure techniques; for now, we utilize a key length of 128 bits, a key matrix order of 4-6, and a Plaintext block size of 16-36 bytes. In this work, we establish the framework for future study by developing a novel method for Laplace transform-based data encryption and decryption utilizing polynomials of degree 8 or higher. Calculations grow more complex, and the key becomes longer and more obtuse, when a high-degree polynomial is used. In the future, similar studies may be conducted using a similar method with other integral transforms. Key matrices of orders 33 to 44 and Plaintext chunks of 9 bytes to 16 bytes are also used in the suggested techniques. Such details might be generalized in further research, allowing for the development of more sophisticated algorithms. The proposed methods  
\begin{table}
\begin{tabular}{c c c c c} \hline \hline
**Secret key (k)** & **Input Feature** & **Coefficient** &
\begin{tabular}{c} **Mean Square** \\ **Error** \\ \end{tabular} & **PSNR** \\ \hline Private Key 1 & 6.5471 & 2.2238 & 1.1582 \(\times\) 123 & 6.5266 \\ Private Key 2 & 6.3258 & \(-\)2.2252 & 1.1633 \(\times\) 123 & 6.5268 \\ Private Key 3 & 6.2478 & \(-\)2.2233 & 1.1631 \(\times\) 123 & 6.525 \\ Private Key 4 & 6.1023 & \(-\)2.2232 & 1.1656 \(\times\) 123 & 6.3992 \\ Private Key 5 & 6.7894 & \(-\)2.2233 & 1.1536 \(\times\) 123 & 6.5326 \\ \hline \hline \end{tabular}
\end{table}
Table 10: Performance parameters for encrypted image.  
make use of a Finite State Machine, a recurrence matrix, and the LU decomposition of a randomly selected non-singular matrix, together with key matrix orders of 44 and 55, key sizes of 128 and 200 bits, and block sizes of 16 and 25 bytes. By increasing the matrix size and the number of rounds, further research may make it possible to send more data safely in parallel. The resulting algorithms are more secure because of this and might potentially keep sensitive information hidden. The suggested works provide a novel encryption and decryption approach based on the Genetic Algorithm, making it exceedingly difficult to guess the key by combining a 128-bit key, a 4-by-4 key matrix, and a Plaintext block size of 16 bytes. More time will be spent theorizing on the Plaintext as a result of this.  
Validation, R.R.B. and Z.B.; Investigation, M.M.H.; Writing-original draft, A.A.; Writing-review & editing, S.M. All authors have read and agreed to the published version of the manuscript.  
The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through a research program under grant number R. G. P. 2/109/43.  
Not applicable.  
Available online: [[https://sipi.usc.edu/database/database.php?volume=misc](https://sipi.usc.edu/database/database.php?volume=misc)]([https://sipi.usc.edu/database/database.php?volume=misc](https://sipi.usc.edu/database/database.php?volume=misc)).  
The authors extend their gratitude to the deanship of scientific research at King Khalid University for funding this work through the research groups program under grant number R. G. P. 2/109/43.  
The authors declare no conflict of interest.