Energy Efficient Wireless Communication using Genetic Algorithm Guided Faster Light Weight Digital Signature Algorithm (GADSA)
Arindam Sarkar, J. K. Mandal

TL;DR
This paper introduces GADSA, a genetic algorithm-based optimized digital signature method for wireless communication that reduces computational time by minimizing modular multiplications, improving efficiency over existing techniques.
Contribution
The paper presents a novel GADSA approach that employs genetic algorithms to optimize modular multiplication in digital signatures, enhancing speed and efficiency in wireless communication.
Findings
GADSA reduces modular multiplications compared to traditional DSA.
Simulation results show GADSA's competitive performance.
GADSA accelerates digital signature computations in wireless networks.
Abstract
In this paper GA based light weight faster version of Digital Signature Algorithm (GADSA) in wireless communication has been proposed. Various genetic operators like crossover and mutation are used to optimizing amount of modular multiplication. Roulette Wheel selection mechanism helps to select best chromosome which in turn helps in faster computation and minimizes the time requirements for DSA. Minimization of number of modular multiplication itself a NP-hard problem that means there is no polynomial time deterministic algorithm for this purpose. This paper deals with this problem using GA based optimization algorithm for minimization of the modular multiplication. Proposed GADSA initiates with an initial population comprises of set of valid and complete set of individuals. Some operators are used to generate feasible valid offspring from the existing one. Among several exponents the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
