Parallelizing Cipher Processes with Finite State Machine in MATLAB for Substitution and Transposition

This article introduces a novel methodology for enhancing the efficiency of cipher processes by employing Finite State Machines (FSMs) within the MATLAB environment. The primary focus of this research is to improve the speed of algorithms used for both substitution and transposition ciphers, which are essential components of cryptographic practices. Recognizing the critical importance of speed in cryptographic operations, this research emphasizes the optimization of these algorithms as a key objective. Traditional encryption methods often struggle with performance limitations; thus, this paper proposes a solution by integrating parallelism into both the encryption and decryption stages through FSMs. This strategy capitalizes on the computational capabilities of modern multi-core processors, allowing for more efficient execution of cryptographic tasks. The research delineates two main phases of the proposed methodology. The first phase centers on transposition ciphers, while the second phase focuses on substitution ciphers. Data encryption is carried out via a meticulously defined FSM-based procedure that alters the input data by substituting and transposing values in accordance with a specified cryptographic key. The concurrent execution of both phases results in a substantial decrease in processing time. Empirical findings indicate that the processing duration is under 1 second for data sizes ranging from 8 to 129 bits, while encrypting and decrypting 1 billion bits of data takes approximately 162 seconds. The improvements in processing speed and the adaptability of these methods highlight their potential as effective solutions for secure data processing applications, which encompass secure communication and the advancement of sophisticated cryptographic protocols.