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

Abstract

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 random 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, the proposed algorithms have been simulated in the network simulator, where 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 ms for 20 up to 70 nodes.

Enhancing Security in Online Voting Systems: A Cryptographic Approach Utilizing Galois Fields

“…Our aim of this paper is to develop an authentication scheme which provides two-factor authentication and overcome the threat of a PRKG. The scheme applies an efficient cryptographic technique inspired from Amiruddin et al [9] and Verma and Jain [10] to generate multiple keys for voters which authorize them to vote and retain the authenticity of the voter. The authentication scheme supports the registration phase of an online voting system which supports medium to large scale elections.…”

“…Amiruddin et al [9] found that key generation techniques are proposed whose performance is measured by testing the algorithm for its key generation speed, key randomness, periodicity and complexity of the algorithm. Verma and Jain [10] studied Reed Solomon codes and parity check matrices are used in correcting passwords that are entered incorrect by the user with minute error.…”