Abstract: The problem of Integer Factorization deals with the disintegration of an integer into prime factors. This has direct applications in cryptanalysis, particularly in breaking the RSA. Lately, ...

The Recursive Division Tree (RDT) algorithm is a mathematical process for measuring the logarithmic height of positive integers. For any integer ( n \ge 2 ), it recursively divides by logarithm-based ...

Ever since Academia Sinica announced a 5-qubit superconducting quantum computer in January 2024, and National Tsing Hua University unveiled a photonic quantum computer capable of integer factorization ...

Ising machines demonstrate significant potential to tackle computationally complex challenges, including combinatorial optimization problems related to logistics, manufacturing, finance, and AI. The ...

This article proposes an algorithmic method for testing divisibility, grounded in the relationships between the multiplication tables of consecutive divisors. The algorithm generates, through an ...

For the last two days my inbox (and LinkedIn messages) has been flooded with questions about headlines claiming that “Chinese researchers broke RSA encryption with a quantum computer, threatening ...

1 College of Computing and Mathematics, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia 2 College of Engineering and Physics, King Fahd University of Petroleum and Minerals, ...

Quantum computing represents an existential threat to modern cryptographic defenses, particularly for non-human identities—machines, IoT devices, workloads, applications, services and APIs—which rely ...