A Classical Approach to Factorizing Large Co-Primes

Authors

  • Roshan Kumar Singh Senior Manager, Pune, India

Keywords:

Coprime, Factorizing, Algorithm, Hamiltonian, Positional Hamiltonian, Complemental

Abstract

Last year when I undertook a course for Quantum Computing & Machine Learning, it came to my knowledge that security of RSA tokens are heavily dependent on the fact that it is NP hard problem to factorize a large (> 128 bits) coprime number. Since then, I have been inclined to invent/discover a classical approach that debunks the NP hard problem for factorizing large coprime numbers. This paper is an attempt to illustrate the approach that can be developed into a computational algorithm as a solution to accurately determine factors of large coprime numbers.

Downloads

Download data is not yet available.

Downloads

Published

22-06-2023

Issue

Vol. 4 No. 6 (2023)

Section

Articles

License

Copyright (c) 2023 Roshan Kumar Singh

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
R. K. Singh, “A Classical Approach to Factorizing Large Co-Primes”, IJRAMT, vol. 4, no. 6, pp. 73–76, Jun. 2023, Accessed: Oct. 18, 2024. [Online]. Available: https://journals.ijramt.com/index.php/ijramt/article/view/2752