An Enhanced Key Schedule Algorithm of PRESENT-128 Block Cipher for Random and Non-Random Secret Keys

Abstract

The key schedule algorithm (KSA) is a crucial element of symmetric block ciphers with a direct security impact. Despite its undeniable significance, the KSA is still a less focused area in the design of an encryption algorithm. PRESENT is a symmetric lightweight block cipher that provides the optimal balance between security, performance, and minimal cost in IoT. However, the linear functions in KSA lead to a slow and predictable bit transition, indicating the relationship between round keys. A robust KSA should produce random and independent round keys irrespective of the secret key. Therefore, this research aims to improve the KSA PRESENT-128 block cipher with enhanced randomness, round key bit difference, and the avalanche effect. The experiments on round keys and ciphertext with random, low density and high-density secret key datasets endorse the expected improvements. Moreover, the results show that the improved KSA produces random round keys that successfully pass the NIST randomness test. The bit transition from one round key to another is increased from 20% to 40%, where a greater inclination of the avalanche effect has an increased effect with 50% bit change. On the other hand, the improved KSA PRESENT requires an additional 0.001871 s to generate round keys, as a security cost trade-off.

A Chunked and Disordered Data Privacy Protection Algorithm: Application to Resource Platform Systems

“…Although these methods can protect the information in the resource platform, all of them have some shortcomings in one way or another. The commonly used information encryption and decryption algorithms have problems related to key distribution, which may cause indelible losses if the key is leaked or the system is accessed by lifting rights in an open and complex network architecture [31][32][33][34][35]. In some scenarios with high-security-factor requirements, multiple DES is usually used, which further increases the algorithm's complexity by multiple iterations and improves the security of encrypted data to some extent.…”

Node authentication and encrypted data transmission in mobile ad hoc network using the swarm intelligence‐based secure ad‐hoc on‐demand distance vector algorithm

“…Public key coordinators are calculated based on distance during the t and δt time. Both nodes selected any equation from the elliptic curve in the form of y 2 = x 3 + ax e + b mod p where the condition is that an equation must satisfy the elliptic curve, that is, 4 a 3 + 27b 2 ≠ 0 and find the coordinators on the curve over Z p where p is the modulus [32]. The ECC algorithm calculates secret key points, as shown in algorithm 1.…”

“…It is built on a substitution-permutation network and uses 64-bit blocks for the 80-bit and 128-bit keys with GE requirements of 1570 and 1886, respectively. A version of PRE-SENT has a minimal GE requirement of approximately 1000 GE, and it takes between 2520 and 3010 GE to offer sufficient security [32].…”

Innovative Transformation of S-Box Through Chaotic Map Using a Pragmatic Approach

“…A substitution box (S-Box) is an essential part of encryption algorithms and aids in performing the nonlinear transformation and causes bits to get confused [16]. Since static S-Box block ciphers employ the same S-Box for every input, they are weak and open to intrusion [17][18] [19]. Dynamic S-Boxes, on the other hand, are more robust and provide greater protection via confusion since they are reliant on key [20][21] [22].…”