Crunching the numbers The RSA algorithm works as follows: First, I find two huge (at least 100 digits each!) prime numbers p and q, and then I multiply them together to get the even bigger number N.

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 ...

In new research that is not yet peer evaluated, mathematicians from Hong Kong and North Carolina say they’ve figured out a way to predict prime numbers. But the paper is confusing and makes ...

Now in a new study, physicists have set a new record for quantum factorization by developing the first quantum algorithm that can factor a three-digit integer, 143, into its prime factors, 11 and 13.