SECURE IOT COMMUNICATIONS USING SCRP-DRIVEN DYNAMIC QUASIGROUP CRYPTOGRAPHY
Abstract
Modern IoT systems must solve the challenging task of providing secure and efficient communication, as conventional cryptographic algorithms require high computations and/or memory. The paper describes a new lightweight block encryption algorithm with dynamic Theta Quasigroups, which are generated using the Shift Cyclic Random Permutation method. The novelty of this paper is the design of a dynamic, equation-driven quasigroup generation framework that avoids large lookup tables, minimizing the memory overhead while offering strong security with high efficiency in processing. This work contributes to new knowledge by presenting how quasigroup algebra can be turned into a scalable and energy-efficient cryptographic model, optimized for IoT environments. Key entropy and resistance to key recovery and post-quantum attacks are further improved by introducing a 256-bit master key combined with a 128-bit salt and 25-bit random padding. The robustness and randomness properties of the algorithm are confirmed by a security evaluation using the NIST Statistical Test Suite. Experimental comparisons reveal that the proposed method outperforms AES in encryption speed and memory efficiency, particularly for small and medium data sizes, while being compliant with green computing principles. Beyond the purely technical contribution, this work shall also contribute to the educational and theoretical development of lightweight cryptography by providing an easily understandable mathematical framework for teaching and research in IoT security. In summary, the SCRP-driven TQG algorithm proposed here opens a new direction in the design of secure, efficient, and sustainable encryption solutions for IoT and embedded systems.
Fields of Study & Subjects
Cryptographic Implementations and Security
Chaos-based Image/Signal Encryption
Coding theory and cryptography
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 15 January 2026