EULER'S TOTIENT FUNCTION AND SOME OF IT'S APPLICATIONS IN CRYPTOGRAPHY
The Euler's totient function is an important concept in number theory. It counts the positive integers up to n, that are coprime with n. This work delves into the definitions, properties as well as the computational methods, emphasizing its significances in cryptography
Authors
- SUNDAY ADEBISI
Publication Details
- Journal
- Confluence Journal of Science and Technology
- Published
- 2025-01-01
- DOI
- https://doi.org/10.5455/cujostech.250401
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00