Encryption Symmetric secret Key in Wireless Sensor Network Using AES Algorithm

Authors

  • Sahar Najah Hussein Department of Computer Science, College of Science for Women, University of Babylon, Hillah, Iraq
  • Ali Hamzah Obaid Al-Furat Al-Awsat Technical University Technical Institute of Babylon
  • Ali Jabbar Department of Software, College of Information Technology, University of Babylon, Hillah, Iraq

DOI:

https://doi.org/10.24996/ijs.2022.63.11.38

Keywords:

NS2, WSN, Network throughput, Star Topology, Lightweight, SHA2

Abstract

      Wireless sensor network (WSN) security is an important component for protecting data from an attacker. For improving security, cryptography technologies are divided into two kinds: symmetric and asymmetric. Therefore, the implementation of protocols for generating a secret key takes a long time in comparison to the sensor’s limitations, which  decrease network throughput because they are based on an asymmetric method. The asymmetric algorithms are complex and decrease network throughput. In this paper, an encryption symmetric secret key in wireless sensor networks (WSN) is proposed. In this work, 24 experiments are proposed, which are encryption using the AES algorithm in the cases of 1 key, 10 keys, 25 keys, and 50 keys. In each experiment, two chains are combined by using a hash function (SHA-2) to produce secret keys. The Network Simulator Version 2 (NS2) was used to assess the network throughput for the generated key. The randomness of the suggested LWM method has been tested by using the Diehard statistical test and the Entropy test. The results of the tests show that the encryption secret keys have a high level of data randomness.

Downloads

Published

2022-11-30

Issue

Section

Computer Science

How to Cite

Encryption Symmetric secret Key in Wireless Sensor Network Using AES Algorithm. (2022). Iraqi Journal of Science, 63(11), 5037-5045. https://doi.org/10.24996/ijs.2022.63.11.38

Similar Articles

1-10 of 289

You may also start an advanced similarity search for this article.