LWLRD: New lightweight encryption algorithm for Low recourse devices

Abstract

In resource-constrained situations, the demand for secure yet lightweight cryptographic algorithms is particularly high, especially for applications such as mobile payments. This work offers a unique encryption algorithm that aims to find a balance between strong security and economic performance. Our method employs a unique 5-bit S-box derived from the Cube tent chaotic function, a previously unexplored source of S-box production. We carefully chose an S-box with ideal cryptographic features, including low differential approximation probability (DAP), linear probability (LP), and high nonlinearity, which improves resistance to various attacks. To improve security, we use a dynamic P-box formed by a logistic map, with the initial value taken from the secret key. This assures that the P-box configuration is unique to each key, removing fixed patterns that attackers could exploit. Furthermore, we offer a better key generation approach based on the PRESENT algorithm, but with increased randomness and complexity to make the system more resistant to key recovery attacks. Our extensive security and performance study proves the algorithm's efficacy. The encryption procedure has a relatively short execution time of 1.3 milliseconds, and the memory footprint is small at 0.003969 MB. These findings demonstrate the algorithm's applicability for resource-constrained situations, making it a suitable choice for protecting sensitive data in mobile and embedded devices.