D-PRESENT: A Lightweight Block Cipher with Dynamic Key-Dependent Substitution Boxes
Ronniel D. Labio, Enrique D. Festijo · 2020
The need of appropriate cryptographic solution into the embedded applications is one of the major concerns of IoT developers. The small devices used in this application have low computation power, small memory, and limited power supply. Hence, the conventional cryptographic primitives are not suited. Among many lightweight algorithms, PRESENT is one of the two recognized by regulatory body of cryptography worldwide fitted for small devices. PRESENT is an example of a Substitution-Permutation Network (SPN) that consists 31 rounds. In each round it performs three operations; add round key, substitution and permutation. For substitution operation, the S-box used in both Substitution layer and Key scheduling of PRESENT is static in nature. Despite of its recognition, PRESENT is susceptible for offline analysis of an attacker due to a static S-box used in key scheduling and substitution layer. In the current study, D-PRESENT was developed to improve performance of PRESENT algorithm in terms of avalanche effect, execution time and throughput and eventually reduced susceptibility from any key cryptanalysis. The results showed that there is a performance improvement in D-PRESENT over PRESENT with 2.53% in terms of avalanche effect, 31.76 in terms of execution time and 47.06% in terms of throughput.