Academia.eduAcademia.edu

Figure 3 – uploaded by Indonesian Journal of Electrical Engineering and Computer Science

See full PDFdownloadDownload figure
Figure 4. Flow chart of proposed (LED-HCKG) 80-bit Key

Figure 4 Flow chart of proposed (LED-HCKG) 80-bit Key

Related Figures (6)

Figure |. Block diagram of LED-64 bit The encryption method utilized by LED, as shown in Figure 1, comprises two core operations: AddRoundKey and Step. The number of rounds depends on the encryption key size: 32 rounds for a 64-bit key and 48 rounds for a 128-bit key. In addition, the 64-bit plaintext X and the 64-bit secret key K are presented by 16 four-bit nibbles in a 4x4 array matrix during the encryption process, as shown in (1) and (2), respectively.
Figure |. Block diagram of LED-64 bit The encryption method utilized by LED, as shown in Figure 1, comprises two core operations: AddRoundKey and Step. The number of rounds depends on the encryption key size: 32 rounds for a 64-bit key and 48 rounds for a 128-bit key. In addition, the 64-bit plaintext X and the 64-bit secret key K are presented by 16 four-bit nibbles in a 4x4 array matrix during the encryption process, as shown in (1) and (2), respectively.
The proposed method (HCKG) explains how chaotic hybrid maps can produce highly randomized numbers by integrating two maps of a chaotic system (3D Lorenz map and 2D Henon map) and by using (3) and (4) sequentially. Pseudocode 2 explains the method of the proposed HCKG with initial values and control parameters for both Lorenz and Henon chaotic maps. We take an 80-bit (HCKG) as the master secret key and use it as a dynamic key with a lightweight LED algorithm to improve its performance and let data be encrypted at a high level of chaos, as illustrated in Figure 4.
The proposed method (HCKG) explains how chaotic hybrid maps can produce highly randomized numbers by integrating two maps of a chaotic system (3D Lorenz map and 2D Henon map) and by using (3) and (4) sequentially. Pseudocode 2 explains the method of the proposed HCKG with initial values and control parameters for both Lorenz and Henon chaotic maps. We take an 80-bit (HCKG) as the master secret key and use it as a dynamic key with a lightweight LED algorithm to improve its performance and let data be encrypted at a high level of chaos, as illustrated in Figure 4.
Figure 2. 3D view of Lorenz Map [33] _ Figure 3. 3D view of Henon Map [34] Where, x, and y, represent the initial condition of the map, a = 1.45; b = 0.3 are the control parameters of the system, as depicted in Figure 3 [34].
Figure 2. 3D view of Lorenz Map [33] _ Figure 3. 3D view of Henon Map [34] Where, x, and y, represent the initial condition of the map, a = 1.45; b = 0.3 are the control parameters of the system, as depicted in Figure 3 [34].
In addition, the LED cipher repeatedly used the same initialization key every four rounds during encryption. We modified the HCKG by applying low-complexity operations, as shown in Pseudocode 3. Rotating by 61-bit positions to the left successive by the round counter value (i) is exclusive or with bits (K19K1gKk17K16K15) to generate the subkeys. These subkeys are XORed every four rounds with the state (64 bits) to increase the complexity of the ciphertext. Adding subkeys to the state makes the output cipher more complex and resistant to known attacks. Also, the HCKG with subkeys reduced the total LED rounds from 32 to 24 to minimize the computation cost while maintaining an efficient security level.
In addition, the LED cipher repeatedly used the same initialization key every four rounds during encryption. We modified the HCKG by applying low-complexity operations, as shown in Pseudocode 3. Rotating by 61-bit positions to the left successive by the round counter value (i) is exclusive or with bits (K19K1gKk17K16K15) to generate the subkeys. These subkeys are XORed every four rounds with the state (64 bits) to increase the complexity of the ciphertext. Adding subkeys to the state makes the output cipher more complex and resistant to known attacks. Also, the HCKG with subkeys reduced the total LED rounds from 32 to 24 to minimize the computation cost while maintaining an efficient security level.
6.2. Computation cost NIST SP 800-22 has outlined 15 significant statistical tests suites for cryptographic applications that determine the strength of any cryptographic algorithm and estimate the actual randomness properties produced by the cipher. The NIST tests use the significant value to determine whether the succession rate is random. The sequence is regarded as random if the P-value is less than 0.01 or non-random if it is more significant than 0.01. So, the results of applying all these tests to the ciphertext generated by LED-HCKG are shown in Table 1 based on the values recorded. LED-HCKG ciphertext does better than the original LED in 13 out of 15 NIST tests. This indicates that the new approach (LED-HCKG), enhanced with the Key generated by using chaotic hybrid maps, 3D Lorenz, and 2D Henon maps, achieves a significant level of confusion and diffusion. It increases by almost 0.3326, higher than the traditional LED algorithm regarding data confidentiality and integrity. An encryption algorithm is efficient when it takes less time to calculate and has fewer rounds. The encryption time of the proposed algorithm is listed and compared with the encryption time of the original LED cipher in Table 2, which shows how long it takes for both algorithms to encrypt each proposed plaintext size. It is evident from Table 2 that the proposed scheme (LED-HCKG) encryption time is less than the original LED cipher because the complexity of HCKG with subkeys reduces the original LED total rounds from 32 to 24 to minimize the computation cost with an efficient security level.
6.2. Computation cost NIST SP 800-22 has outlined 15 significant statistical tests suites for cryptographic applications that determine the strength of any cryptographic algorithm and estimate the actual randomness properties produced by the cipher. The NIST tests use the significant value to determine whether the succession rate is random. The sequence is regarded as random if the P-value is less than 0.01 or non-random if it is more significant than 0.01. So, the results of applying all these tests to the ciphertext generated by LED-HCKG are shown in Table 1 based on the values recorded. LED-HCKG ciphertext does better than the original LED in 13 out of 15 NIST tests. This indicates that the new approach (LED-HCKG), enhanced with the Key generated by using chaotic hybrid maps, 3D Lorenz, and 2D Henon maps, achieves a significant level of confusion and diffusion. It increases by almost 0.3326, higher than the traditional LED algorithm regarding data confidentiality and integrity. An encryption algorithm is efficient when it takes less time to calculate and has fewer rounds. The encryption time of the proposed algorithm is listed and compared with the encryption time of the original LED cipher in Table 2, which shows how long it takes for both algorithms to encrypt each proposed plaintext size. It is evident from Table 2 that the proposed scheme (LED-HCKG) encryption time is less than the original LED cipher because the complexity of HCKG with subkeys reduces the original LED total rounds from 32 to 24 to minimize the computation cost with an efficient security level.
7. CONCLUSION LED as a block cipher was hacked and needed to satisfy security requirements. Therefore, LED demands greater randomness, confusion, and diffusion. This paper describes a modified LED that adopts and generates a master secret key (HCKG) using chaotic hybrid maps, 3D Lorenz and 2D Henon, to achieve a sufficient level of confusion and diffusion. In addition, the original LED cipher used a fixed key every four rounds during the encryption process. We modified the HCKG to get subkeys via simple mathematical and logical operations and then XORed it every four rounds to increase the complexity of the encryption process.
7. CONCLUSION LED as a block cipher was hacked and needed to satisfy security requirements. Therefore, LED demands greater randomness, confusion, and diffusion. This paper describes a modified LED that adopts and generates a master secret key (HCKG) using chaotic hybrid maps, 3D Lorenz and 2D Henon, to achieve a sufficient level of confusion and diffusion. In addition, the original LED cipher used a fixed key every four rounds during the encryption process. We modified the HCKG to get subkeys via simple mathematical and logical operations and then XORed it every four rounds to increase the complexity of the encryption process.
Related topics:
Henon Map
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved