Design And Analysis Of Lightweight Cryptographic Algorithms Using Permutation Polynomials For Iot-Based Network Security

When it comes to protecting environments with limited resources, the proliferation of Internet of Things (IoT) devices has made it more difficult to do so. This is because existing cryptographic methods are sometimes either too difficult to use or too expensive to run. The purpose of this study is to describe the design and analysis of lightweight cryptographic algorithms that make use of permutation polynomials over finite fields. Because they are straightforward algebraically and very non-linear, permutation polynomials are an excellent choice for crypt components that are relatively tiny, such as S-boxes and mixing layers. Among the things that we evaluate are its speed, the amount of memory it consumes, its level of security, and how well it can withstand cryptanalytic assaults. Using permutation polynomial-based designs, it is possible to create Internet of Things applications that are not only secure but also quick and scalable, as demonstrated by the simulation results on Internet of Things benchmarks.