Secure IoT Seed-based Matrix Key Generator A Novel Algorithm for Steganographic Security application

被引:0
作者
Aine, Youssef Nour-El [1 ]
Leghris, Cherkaoui [1 ]
机构
[1] Hassan II Univ, Lab Math Comp Sci & Applicat Sci & Technol, Fac Mohammedia, Mohammadia, Morocco
关键词
Security; IoT; steganography; key exchange; cryptography;
D O I
10.14569/IJACSA.2024.01503108
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The rapid evolution of the Internet of Things (IoT) has significantly transformed various aspects of both personal and professional spheres, offering innovative solutions in fields from home automation to industrial manufacturing. This progression is driven by the integration of physical devices with digital networks, facilitating efficient communication and data processing. However, such advancements bring forth critical security challenges, especially regarding data privacy and network integrity. Conventional cryptographic methods often fall short in addressing the unique requirements of IoT environments, such as limited device computational power and the need for efficient energy consumption. This paper introduces a novel approach to IoT security, inspired by the principles of steganography - the art of concealing information within other non-secret data. This method enhances security by embedding secret information within the payload or communication protocols, aligning with the low-power and minimal processing capabilities of IoT devices. We propose a steganographic key generation algorithm, adapted from the Diffie- Hellman key exchange model, tailored for IoT. This approach eliminates the need for explicit parameter exchange, thereby reducing vulnerability to key interception and unauthorized access, prevalent in IoT networks. The algorithm utilizes a pre-shared 2D matrix and a synchronized seed- based approach for covert communication without explicit data exchange. Furthermore, we have rigorously tested our algorithm using the NIST Statistical Test Suite (STS), comparing its execution time with other algorithms. The results underscore our algorithm's superior performance and suitability for IoT applications, highlighting its potential to secure IoT networks effectively without compromising on efficiency and device resource constraints. This paper presents the design, implementation, and potential implications of this algorithm for enhancing IoT security, ensuring the full realization of IoT benefits without compromising user security and privacy.
引用
收藏
页码:1077 / 1086
页数:10
相关论文
共 24 条
[11]   Ensuring Smart Agriculture System Communication Confidentiality Using a New Network Steganography Method [J].
Nour-El Aine, Youssef ;
Leghris, Cherkaoui .
SMART AND SUSTAINABLE AGRICULTURE, SSA 2021, 2021, 1470 :19-29
[12]   Dynamical Pseudo-Random Number Generator Using Reinforcement Learning [J].
Park, Sungju ;
Kim, Kyungmin ;
Kim, Keunjin ;
Nam, Choonsung .
APPLIED SCIENCES-BASEL, 2022, 12 (07)
[13]  
Rimani R., 2021, Indonesian Journal of Electrical Engineering and Computer Science, V21, P1751, DOI [10.11591/IJEECS.V21.I3.PP1751-1758, DOI 10.11591/IJEECS.V21.I3.PP1751-1758]
[14]  
Sathya K., 2021, IOP Conference Series: Materials Science and Engineering, V1055, DOI 10.1088/1757-899X/1055/1/012076
[15]  
Scott M., 2002, Cryptology, P1
[16]   An Efficient Shuffle-Light FFT Library [J].
Servodio, Salvatore ;
Li, Xiaoming .
2021 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE (IPCCC), 2021,
[17]   Cryptographic technologies and protocol standards for Internet of Things [J].
Sherali, Zeadally ;
Ashok, Kumar Das ;
Sklavos, Nicolas .
INTERNET OF THINGS, 2021, 14
[18]  
Smart N.P., 2016, Cryptography Made Simple. Information Security and Cryptography, DOI [10.1007/978-3-319-21936-310, DOI 10.1007/978-3-319-21936-310]
[19]   Secure and efficient user authentication scheme for multi-gateway wireless sensor networks [J].
Srinivas, Jangirala ;
Mukhopadhyay, Sourav ;
Mishra, Dheerendra .
AD HOC NETWORKS, 2017, 54 :147-169
[20]  
Takaoglu M., 2023, Afyon Kocatepe University Journal of Sciences and Engineering, DOI [10.35414/akufemubid.1128075, DOI 10.35414/AKUFEMUBID.1128075]