Therefore, if an 'algorithm that enables prime factorization of a huge number of digits' is developed, its safety will be shaken.

Prime numbers are whole numbers greater than 1 that are not divisible by any whole number other than 1 and itself. The first few are 2, 3, 5, 7, 11, 13 … To explain how the RSA algorithm works ...

Mathematician Jean Carlos Cortissoz Iriarte, of Cornell University and Los Andes University, says that in order to know how good an algorithm is, one has to consider two factors: the number of ...