International Journal For Multidisciplinary Research

E-ISSN: 2582-2160   •   Impact Factor: 9.24

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Call for Paper Volume 7, Issue 6 (November-December 2025) Submit your research before last 3 days of December to publish your research paper in the issue of November-December.
Submit Research Paper Join as a Reviewer

Plagiarism is checked by the leading plagiarism checker TurnItIn

Call for Paper

Volume 7 Issue 6
November-December 2025

Submit your research paper

Indexing Partners
Academia Advanced Sciences Index Bielefeld Academic Search Engine CiteSeer DRJI Google Scholar Independent Search Engine & Directory Network ISI (International Scientific Indexing) Issuu Mendeley Research Networks
RefSeek ResearcherId - Thomson Reuters ResearchGate Scirus Scribd Semantic Scholar UTeM - Universiti Teknikal Malaysia Melaka Wiki for Call for Papers WorldCat Zenodo

Advances in Computational Number Theory and Its Applications in Modern Cryptography

Author(s) Srinivasa Rao Kadari, P. SatyanarayanaRedddy, R. Srilakshmi, P. Rami Reddy
Country India
Abstract Computational number theory, also known as algorithmic number theory, is a modern and rapidly evolving field focused on the development and analysis of efficient algorithms to solve classical and contemporary problems in number theory and arithmetic geometry. This branch of mathematics plays a pivotal role in the design and implementation of secure cryptographic systems. As computational power increases and algorithms become more sophisticated, computational number theory continues to expand its influence across mathematics, computer science, and especially cryptography. This paper explores the fundamental principles of computational number theory and its close relationship with modern cryptographic practices. It examines essential cryptographic systems such as RSA, elliptic curve cryptography (ECC), and emerging post-quantum algorithms. Core number-theoretic tools—like primality testing, integer factorization, modular arithmetic, and Diophantine equation solving—are analyzed in the context of their cryptographic applications. The historical development and theoretical underpinnings of cryptography are also traced, alongside recent advances and active research areas in the field. By showcasing the intersection of theory and application, this paper highlights the indispensable role of computational number theory in enabling secure communication in the digital age.
Keywords Computational Number Theory, Cryptography, Modular Arithmetic, Primality RSA Testing, Deterministic Primality Tests, Probabilistic Primality Tests, Prime Factorization
Published In Conference / Special Issue (Volume 7 | Issue 5) - One Day National Seminar on “Computational Science: The Intersection of Math, Physics, Chemistry and Computer Science” (SVGASCA-2025) (October 2025)
Published On 2025-10-08
DOI https://doi.org/10.36948/ijfmr.SVGASCA-2025.1117
Short DOI https://doi.org/g95433
View / Download PDF File

Share this



E-ISSN 2582-2160
CrossRef

CrossRef DOI is assigned to each research paper published in our journal.

IJFMR DOI prefix is
10.36948/ijfmr

Downloads
Research Paper Format Copyright Permission Form and Undertaking Form Cover Page Vol 7 Isu 5Cover Page Vol 7 Isu 4Cover Page Vol 7 Isu 3

All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.

CC-BY-SA Open Access

About IJFMR
Fees & Payment
Current Issue
Publication Archive 		Submit Research Paper
Track Submission Status
Publication Guidelines
Publication Ethics
Peer Review & Plagiarism 		Join as a Reviewer
Editors & Reviewers
Reviewer Referral Program
Get Reviewer Membership Certi. 		Website/Journal Policies
Usage Policy
Content Policies
Privacy Policy
Contact Us +91-9687-828-838 editor@ijfmr.com