About this document
Paper 2101 by hrithikashekar2005 is a document available to read on EtoBox.
This study evaluates the efficacy of four number-theoretic algorithms—Modular Exponentiation, Euclidean GCD, Extended Euclidean, and Hash-Based Validation—in digital identification systems. Results indicate that the Euclidean GCD algorithm is the most efficient, while the Modular Exponentiation excels in accuracy but struggles with large exponents. The findings highlight the importance of balancing computational cost, scalability, and security in selecting algorithms for digital identification infrastructur
- Author
- hrithikashekar2005
- Language
- EN