MESSAGE BINARY MATRIX ROTATING TO PROTECT SECRET MESSAGE

Volume-09 Issue 11, November-2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [325] MESSAGE BINARY MATRIX ROTATING TO PROTECT SECRET MESSAGE Namer Ali Aletawi Mansour Ali Abu Sameha FatimaThaher Aburomman Albalqa Applied University, Jordan ABSTRACT Recently, in today’s interconnected digital world, the transmission of both lengthy and concise secret messages is ubiquitous across diverse communication platforms. With the proliferation of sensitive and specialized information being exchanged, safeguarding these messages from potential threats such as intruders, abusers, and data hackers becomes imperative and vital issue. This paper research presents an innovative approach aimed at streamlining message protection procedures while concurrently thwarting hacking attempts. At the core of the presented method lies the utilization of a sophisticated variable content private key designed to facilitate ease of alteration without compromising the integrity of encryption and decryption operations. The pivotal aspect involves leveraging the use of a private key to run a simple chaotic logistic map model to generate the secret key, mandating both the sender and receiver to securely retain this key. By employing selected chaotic parameters values, the secret key can seamlessly adapt to match the length of the confidential message. To fortify the level of security, the message is recommended to convert to binary to get the message binary matrix, and the rows of this matrix will be treated as blocks. Subsequently, the bits within each block are consolidated into a singular vector, which undergoes a left rotation by a predetermined number of bits as specified by generated secret key. The presented methodology is empirically validated through the implementation of various secret text messages. Comparative analyses against existing methods underscore the efficacy and robustness of the proposed approach, substantiating its significant advancements in data protection paradigms. Keywords: Cryptography, SM, MBM, PK, CLMM, RLD. INTRODUCTION Recent advances in message cryptography often focus on enhancing efficiency and security [1-10]. This paper research introduces a novel method of message cryptography using message binary matrix rows rotation, leveraging their inherent mathematical properties to secure secret messages [11-15]. Unlike the standard and traditional methods used in many current applications such as DES, AES, or Blowfish, which rely on complex substitution and permutation networks, the presented method utilizes simpler, yet effective, rotational transformations to manipulate message binary matrix bits. Message binary matrix rows rotation left operations offer several unique advantages [16-20]. Firstly, they are computationally simpler and require fewer resources, making them ideal for environments with limited processing capabilities. Secondly, the deterministic nature of rotational shifts ensures a high-speed operation, crucial for real-time applications. In contrast, the presented method capitalizes on the simplicity and speed of matrix rows rotations, enhancing throughput and reducing latency in cryptographic operations [21-25]. This makes it particularly well-suited for securing messages in high-speed networks or applications requiring rapid encoding and decoding, such as streaming services or realtime communications. By focusing on these aspects, the introduction can effectively set the stage for detailing the proposed crypto-graphic method and its comparative benefits over existing techniques, directly addressing the feedback for more clarity and rationale in your exposition [26-30]. The importance of encrypting confidential messages lies in maintaining confidentiality, integrity, and authenticity, providing maximum data protection from unauthorized access and preventing eavesdropping and manipulation. Encryption also ensures the privacy of sensitive communications for individuals, businesses, and government agencies, and contributes to compliance with legal data protection standards. Message cryptography has the following benefits [31-40]: Volume-09 Issue 11, November-2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [326] - Confidentiality and Privacy: Encryption transforms messages into codes that can only be read by those who possess the decryption key, thus protecting conversations and sensitive information from eavesdroppers and hackers. - Data Integrity: Encryption ensures that messages are not altered or tampered with during transmission and helps detect any attempt to change their content. - Authentication: Encryption helps verify the identity of the sender and recipient, ensuring that the message comes from a trusted source and goes only to the intended recipient. - Protection from Threats: Encryption provides a strong layer of security against identity theft and financial fraud, protecting sensitive personal and business information from theft or unauthorized access. - Regulatory Compliance: Data encryption is a prerequisite for complying with data protection regulations in many sectors, such as healthcare and finance. The presented method aims to address the need for protecting both long and short text messages from potential abusers, intruders, or data hackers [41-45]. The main objective is to simplify the message protection process while making it challenging for hackers to compromise messages. A novel method will be presented, focusing on the utilization of a complex variable content private key that can be easily modified without altering the encryption and decryption procedure [46-50]. A key aspect of the presented method is the utilization of a complex variable content private key. This private key can be easily modified without disrupting the encryption and decryption procedures, thereby enhancing the security of the system. The secret key is generated from private key by running a simple chaotic logistic map model (CLMM) [51-55]. Message crypto method usually contains encryption function (EF) in the message sender part and decryption function (DF) in the message receiver part (see figure 1). The EF manipulates the original source secret message (SM) and the private key (PK) to produce the encrypted (cipher) message, while the DF manipulates the cipher message and the PK to produce the decrypted (original) SM [56-60]. Figure 1: SM crypto process diagram A good crypto method must meet the following requirements [61-70]: - Security: The method must enhance the security of the encryption and decryption procedures to make it difficult for hackers to compromise messages. The method must use a PK longer than 100 bits, this length will be strong enough and it will provide a key space capable to resist hacking attacks. - Encryption quality: The encryption phase should result in a high degree of data distortion, which can be quantified using quality parameters. In this paper research, the following will be deployed: the mean Volume-09 Issue 11, November-2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [327] square error (MSE) as depicted in (1), peak signal-to-noise ratio (PSNR) as depicted in (2), and correlation coefficient (CC) between the original and encrypted-decrypted data. During encryption, the MSE value should be notably high, while the PSNR value should be correspondingly low and the CC value should significantly deviate from 1 [71-75]. - Decryption quality: In the decryption phase, the MSE value should approach zero, indicating minimal distortion, while the PSNR value should approach infinity, indicating high-fidelity reconstruction. Additionally, the CC value should approach 1, signifying strong correlation between the original and decrypted data [76-80]. - Efficiency: The crypto method must fulfill the pre-requisites of effective cryptography, achieving the following objectives: optimization of quality parameters throughout encryption and decryption phases, minimization of encryption and decryption times to maximize throughput (speed), and ensuring flexibility and ease of implementation with provisions for easy acceleration if necessary. The confidential data utilized to generate the secret key must be intricate and resistant to deciphering or hacking [81-86]. - Flexibility: The method must be efficiently used to process short and long messages; the user must have the ability to change the PK without the need to change the EF and DF. - Simplicity: The method must use simple procedures for secret key generation, SM encryption and SM decryption [1-5]. RELATED WORKS Numerous secret SM cryptography methods exist [1-5], with many built upon the foundation of standard encryption techniques like DES (Data Encryption Standard), including variants, such as 3DES, AES (advanced encryption standard), and Blowfish (BF). These standard methods operate by varying parameters, such as key length and number of rounds, as outlined in Table 1 [29–31]. However, standard encryption methods come with inherent limitations [6-10]: 1) PK length is fixed and cannot be altered for each method, limiting flexibility. 2) Encrypted SM must be segmented into fixed-size blocks, offering little adaptability. 3) The number of rounds in the encryption-decryption process is predetermined and unchangeable. 4) Secret key generation is obligatory, with the PK used to derive additional sub-keys . 5) While these methods yield high-quality parameter values in both encryption and decryption phases, they are most efficient with smallto medium-sized SMs. Larger SM sizes lead to reduced throughput and inefficiency. 6) Increased round requirements prolong the cryptography process. 7) Many methods necessitate the use of an S-box, introducing additional computational overhead and memory requirements. Table 1 presents an overview of key parameters and characteristics associated with standard encryption methods, including DES, 3DES, AES, and BF [1-10]. These methods are commonly used for securing SMs in various applications, each with its own set of features and limitations. 1) PK length: This specifies the length of the PK in bits used in each encryption method. The length is fixed for each method, providing varying levels of cryptographic strength. 2) Block size: Block size in bits indicates the size of data blocks processed during encryption and decryption. Similar to the PK length, the block size remains fixed for each method. 3) Ability to deal with data with big size: It reflects the difficulty level in handling image data using the respective encryption-decryption method. Volume-09 Issue 11, November-2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [328] 4) Encryption quality: It describes the quality of encryption achieved by each method, typically evaluated based on parameters, such MSE and PSNR [11-16]. 5) Decryption quality: It represents the quality of decrypted data, often measured in terms of MSE and PSNR, with ideal scenarios exhibiting zero MSE and infinite PSNR. 6) Efficiency: It indicates the speed of encryption and decryption processes. While some methods operate relatively slowly, others offer moderate efficiency. 7) Attack: It identifies potential vulnerabilities to specific attack methods, including brute force attacks, side-channel attacks, and dictionary attacks. 8) Structure: It specifies the underlying structure employed by each encryption method, such as Feistel or Substitution-Permutation. 9) Block cipher: It indicates the use of binary operations in the encryption –decryption process. 10) Rounds: It refers to the number of rounds or iterations performed during encryption and decryption. 11) Flexibility to modification: It indicates whether the method allows for modifications to parameters or key lengths. 12) Simplicity: It reflects the complexity of the encryption-decryption method, with “No” indicating higher complexity. 13) Security level: It evaluates the overall security level provided by each encryption method, ranging from adequate to excellent. 14) Throughput (speed): It represents the speed and efficiency of data processing, with higher throughput indicating faster encryption and decryption rates. Table 1: Summery of crypto standard method features[1-10] Feature DES 3DES AES BF Rounds 16 and fixed 48 and fixed 10, 0r 12 or 14 and fixed 16 and fixed PK length (bits) Fixed with 56 bits Fixed with 112 or 168 bits Fixed with 128, or 192 or 256 bits 32 to 448 bits Security level Adequate Adequate Excellent Excellent Data blocking Needed Needed Needed Needed Block size (bits) 64 and fixed 64 and fixed 128 and fixed 64 and fixed Ability to deal with SM with big size Difficult Difficult Difficult Difficult Encryption quality Excellent Excellent Excellent Excellent Decryption quality Excellent Excellent Excellent Excellent Efficiency Slow Slow Slow Moderate Attack Brute force attack Brute force attack Side-channel attack Dictionary attack Structure Feistel Feistel Substitutionpermutation Feistel Block cipher Binary Binary Binary Binary Flexibility to modification No Yes Yes Yes Simplicity No No No No Speed Low Low Low Moderate This comprehensive overview assists in understanding the strengths, weaknesses, and suitability of each standard encryption-decryption method for different applications and security requirements. The presented method employs a fundamental logical operation to enhance data security [11-15]: left rotation by a secret keydefend number of digits. The rotation left operation can be easily implemented by applying a circular movements of the bits as shown in figure 2.The SM as shown in figure 3 will be represented by a message binary matrix (MBM), each row will be treated as a message block, this row will be rotated left for a specified Volume-09 Issue 11, November-2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [329] number of rotating left digits (RLD) defined by the generated secret key (SK), and it is important to highlight that each row will use its own RLD. Figure 2: Rotating left operation illustration Figure 3: Representing SM using MBM This strategic approach ensures robust SM protection by introducing varying layers of complexity and obfuscation, rendering the encrypted data more resistant to unauthorized access and decryption attempts. Trough the meticulous selection and implementation of these operations, the presented method aims to elevate the security standards of SM encryption-decryption methodologies [20-26]. The presented method will use a PK of 128 bits length, this key will contain the values of the chaotic parameters r and x, these values with the message length L will be used to run a chaotic logistic map model (CLMM) to generate the secret key, which will contains the values of the RLDs for the MBM rows, figure 4 shows how to use the simple CLMM to generate the SK, while figure 5 shows how to use SK to apply SM encryptiondecryption by applying rotating left the bits of each MBM row bits. Volume-09 Issue 11, November-2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [330] Figure 4: Using CLMM to generate SK Figure 5: Using SK to rotate left MBM rows Methodology: The encryption-decryption algorithms Encryption algorithm (see figure 6): Inputs: SM, PK Output: Encrypted SM Process: (1) SM preparation: a) Get the SM b) Get the message length (L) c) Convert the SM to binary to get MBM. (2) SK generation: a) Get the PK values (r and x). Volume-09 Issue 11, November-2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [331] b) Run CLMM to generate a chaotic sequence (CS) with length equal L. c) Convert the CS to integer values within the range 1 to 7. (3) Encryption: For each MBM row do the following: a) Get the associated for the row RLD from the SK. b) Extract the row. c) Rotate the row for an RLD positions. d) Return back the row to MBM. (4) Convert MBM to decimal. (5) Convert the decimal results to characters to get the encrypted SM. Figure 6: Encryption algorithm implementation Decryption algorithm (see figure 7): Inputs: Encrypted SM, PK Output: Decrypted SM Process: (1) SM preparation: a) Get the SM b) Get the message length (L) c) Convert the SM to binary to get MBM. (2) SK generation: a) Get the PK values (r and x). b) Run CLMM to generate a chaotic sequence (CS) with length equal L. c) Convert the CS to integer values within the range 1 to 7. (3) Encryption: For each MBM row do the following: a) Get the associated for the row RLD from the SK. b) Extract the row. Volume-09 Issue 11, November-2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [332] c) Rotate the row for 8-RLD positions. d) Return back the row to MBM. (4) Convert MBM to decimal. (5) Convert the decimal results to characters to get the decrypted SM. Figure 7: Decryption algorithm implementation RESULTS Te proposed method was implemented using MATLAB 7, capitalizing on the computational capabilities of a processor operating at 2.4 MHz and an Intel i5 processor with a RAM capacity of 8 GB. To thoroughly evaluate its performance across various scenarios, we employed a diverse range of short and long messages of different lengths during the implementation phase. To further validate the method’s performance, short messages of varying lengths were encrypted. Concurrently, standard data cryptography methods were also employed on the same set of messages for comparative analysis. This rigorous evaluation allows for a comprehensive understanding of the presented method’s effectiveness and efficiency in securing data confidentiality across diverse message lengths and encryption technique. Table 2 shows the obtained experimental results for a short message. From Table 2, it can be seen that the presented method is more efficient than the standard methods of SM cryptography and decreases the encryption time (ET), as shown in Figure 8. Table 2: ET (second) results of short messages implementation L (character) DES 3DES AES BF Presented 24 0.1510 0.1800 1.1160 0.0864 0.0280 48 0.3020 0.3400 2.2120 0.1528 0.0290 72 0.4580 0.5200 3.3280 0.2392 0.0310 96 0.6140 0.7100 4.4340 0.3256 0.0340 120 0.7700 0.8009 5.5600 0.4120 0.0360 144 0.9260 1.0700 6.6760 0.5084 0.0390 168 1.0820 1.2400 7.8020 0.5048 0.0410 192 1.2380 1.4200 8.8280 0.6512 0.0430 216 1.3040 1.5200 9.9440 0.6776 0.0440 240 1.4600 1.7000 10.7600 0.7640 0.0460 Volume-09 Issue 11, November-2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [333] Figure 8: Comparison of encryption times for short messages From Figure 8, we can glean insights into the comparison of encryption times for short messages between the proposed method and standard methods of data cryptography. Here are some key points extracted from the figure: 1) Efficiency of the presented method: The presented method demonstrates superior efficiency compared to standard methods, as evidenced by shorter encryption times across various message lengths. 2) Consistent performance: Regardless of the message length, the proposed method consistently exhibits lower encryption times than standard methods, highlighting its robustness and reliability in encrypting short messages. 3) Significant time reduction: The encryption times achieved by the proposed method are notably shorter compared to those of standard methods. This reduction in encryption time is crucial for applications requiring rapid data encryption without compromising security. 4) Impact of message length: While there is variation in encryption times based on message length, the proposed method consistently outperforms standard methods across all message lengths considered in the comparison. 5) Real-time encryption capabilities: Te faster encryption times offered by the proposed method make it well-suited for real-time applications where timely data encryption is essential. Long messages with various lengths were selected; these messages were implemented using the presented method, the standard methods of SM cryptography were also implemented using the same messages. Table 3 shows the obtained experimental results for the long messages.