A Comparative Evaluation of Number-Theoretic Algorithms for Assessing Their Relative Efficacy in Digital Identification
International Journal of Emerging Technologies and Innovative Research · 2025
DOI: 10.48175/ijetir-2101 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Emerging Technologies and Innovative Research, 2025. Verfasst von Deepak Dhuware and Dr. Jaya Kushwah. Die Arbeit nennt 25 Literaturangaben.
Abstract (Originalsprache)
Background
Digital identification systems increasingly rely on mathematical foundations to ensure accuracy, authenticity, and secure verification. Number-theoretic algorithms—rooted in prime numbers, divisibility, and modular arithmetic—play a central role in identity validation, cryptographic procedures, and error-resistant data processing.
Objective
This study conducts a comparative evaluation of key number-theoretic algorithms to determine their relative efficacy in supporting digital identification processes. The focus is on assessing their performance, stability, and reliability when applied to identification token verification and numerical validation tasks.
Methods
Four algorithms—Modular Exponentiation Algorithm (MEA), Euclidean GCD Algorithm, Extended Euclidean Algorithm, and Hash-Based Number-Theoretic Validation (HNTV)—were implemented and tested on a dataset of 1000 synthetic digital identity entries. Each algorithm processed 128-bit identity tokens and 256-bit key components under identical computational conditions using Python 3.12. Performance indicators included execution time, memory footprint, accuracy of validation, and collision tendency. Non-parametric statistical tests (Kruskal–Wallis and Mann–Whitney U) were performed to examine significant performance variations.
Results
The Euclidean GCD algorithm provided the highest computational efficiency with consistently low memory consumption, making it advantageous for lightweight identification modules. MEA excelled in accuracy and cryptographic computations but experienced scaling limitations with very large exponents. The Extended Euclidean Algorithm delivered dependable modular inverses essential for secure key-based identification. HNTV demonstrated strong performance for bulk identity validation with acceptable collision levels.
Conclusion
Overall, the comparative analysis reveals that traditional deterministic number-theoretic algorithms offer speed and structural stability, while hybrid hashing-based frameworks extend robustness for large-scale identification. Choosing an appropriate algorithm requires balancing computational cost, scalability needs, and security requirements to enhance the efficiency of digital identification infrastructures..
Zitieren
APA
Kushwah, D. D. A. D. J. (2025). A Comparative Evaluation of Number-Theoretic Algorithms for Assessing Their Relative Efficacy in Digital Identification. International Journal of Emerging Technologies and Innovative Research. https://doi.org/10.48175/ijetir-2101
Vancouver
Kushwah DDADJ. A Comparative Evaluation of Number-Theoretic Algorithms for Assessing Their Relative Efficacy in Digital Identification. International Journal of Emerging Technologies and Innovative Research. 2025. doi:10.48175/ijetir-2101
BibTeX
@article{Kushwah2025,
author = {Kushwah, Deepak Dhuware and Dr. Jaya},
title = {A Comparative Evaluation of Number-Theoretic Algorithms for Assessing Their Relative Efficacy in Digital Identification},
journal = {International Journal of Emerging Technologies and Innovative Research},
year = {2025},
doi = {10.48175/ijetir-2101}
}
EUVIMED