A Hybrid Combinatorial-Boolean Approach Toward Perfect Secrecy in IoT

This chapter completes our discussions in this book via presenting the hybrid combinatorial-Boolean approach for perfectly secure cryptography in IoT. To this end, we first propose a Boolean description along with an enumeration method as well as an encoding scheme for encryption/decryption algorithms. We especially apply the description, enumeration, and encoding schemes on perfectly secure cryptographic algorithms. The description, enumeration, and encoding schemes are then connected to Latin squares. We present a one-to-one mapping between perfectly secure algorithms and Latin squares. This leads to the following two significant achievements. Since the literature comes with some methods for generating random Latin squares Selvi et al. (IOSR J Comput Eng 16(1):76–80, 2014), Kwan and Sudakov (2017), Fontana (Electron J Stat 8(1):883–893, 2014), DeSalvo (2017), Zolfaghari et al. (2022), our encoding and modeling scheme makes it possible to create random perfectly secure algorithms. This is one step toward random-key random algorithm perfectly secure cryptography, which exponentially increases the robustness of perfectly secure cryptographic algorithms against chosen plain text attacks.Enumerating Latin squares is a challenging problem unsolved for dimensions above 12. Our enumerating scheme along with the mapping to Latin squares is one step forward toward the enumeration of Latin squares. At the end of this chapter, we reason why the approach is proper for use in IoT systems.