New Key Generation and Encryption Algorithms for Privacy Preservation in Mobile Ad Hoc Networks

Mobile Ad Hoc Networks (MANETs) get widespread applications along with the evolving technologies. However, MANETs are at risk due to the shortage of security mechanisms. In this paper, we propose new algorithms for key generation and encryption for privacy preservation in MANETs. Our key generation...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of communication networks and information security Ročník 9; číslo 3; s. 376 - 385
Hlavní autori: Amiruddin, Ratna, Anak Agung Putri, Sari, Riri Fitri
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Kohat Kohat University of Science and Technology (KUST) 01.12.2017
Predmet:
Algorithms
Communication
Computer simulation
Confidentiality
Confusion
Data encryption
Diffusion rate
Encryption
Evacuations & rescues
Fibonacci numbers
International conferences
Methods
Mobile ad hoc networks
Mobile communication systems
Network security
Preservation
Privacy
Researchers
Studies
Wireless networks
United States > US
China
India
ISSN:2073-607X, 2076-0930
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Mobile Ad Hoc Networks (MANETs) get widespread applications along with the evolving technologies. However, MANETs are at risk due to the shortage of security mechanisms. In this paper, we propose new algorithms for key generation and encryption for privacy preservation in MANETs. Our key generation algorithm modified Fibonacci sequence by adding scrambling factors to generate random key sequences with required length but incurred low computational overhead, whereas the encryption/decryption algorithm utilizes the One Time Pad (OTP) system by adding scrambling factors for data confidentiality which satisfies the randomness, diffusion, and confusion tests. Simulation of the proposed algorithms was conducted using Matlab and NS-2. Experiment results showed that the proposed algorithms produced random key sequences and Ciphertexts. Through several tests i.e. speed, correlation and autocorrelation, diffusion, and confusion tests, the simulation result showed the superiority of our algorithms over the other algorithms. For the proof of concept, our algorithms have been simulated in the network simulator, and the result showed that along with the increase of the number of nodes, the throughput of the network increased, while the delay is relatively constant around 6000 µs for 20 up to 70 nodes.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2073-607X
2076-0930