Number Theory and its Applications in Cryptography Recent Developments

Abstract

Cryptography depends on difficult number-theoretic computational procedures which include the process of factorization and both modular arithmetic and discrete logarithms. This paper examines the key components of number theory which modern cryptography uses in its algorithms. The paper evaluates current constitutional challenges along with new innovative approaches in cryptographic protocol optimization as well as security protection methods for current emerging threats.