Modular Arithmetic and it's theoretical foundations in public-key Cryptography

Read full text Summarise with VIRAT
Cited by: 0
References: 2

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Modern public-key encryption is mathematically based on modular arithmetic.To guarantee safe communication over open networks, cryptographic algorithms mainly rely on number theory ideas like prime numbers, modular expo-nentiation, and congruence relations.The theoretical underpinnings of modular arithmetic are reviewed in this essay, along with how they underpin cryptographic algorithms like Diffie-Hellman key exchange and RSA.The significance of mathematical models like Fermat's and Euler's theorems in encryption and decryption mechanisms is examined.Additionally, the study contrasts various public-key algorithms and emphasizes how modular arithmetic contributes to both robust security and computational efficiency.

Fields of Study & Subjects

Cryptography and Residue Arithmetic Cryptography and Data Security Computer Science and Engineering

Publication details

Journal / source
International Research Journal of Modernization in Engineering Technology and Science
Publication date
18 March 2026
Language
EN