What do we
know about cracking numbers:
Here are some ways:
(1) Try dividing numbers one after the other until
you reach the divisor. This is very slow.
(2) Fermat’s Factorization method. If the
primes are close together there is a faster way
to crack the number. Click
here to find out.
(3) Sieve methods: This is advanced mathematics
but still not fast enough to make Internet codes
insecure - yet.
(4) Maybe the proof of the Riemann Hypothesis
will produce a fast way to crack numbers into
primes. It is probably wishful thinking but who
knows what a deeper understanding of the primes
might reveal.
(5) The invention of a quantum computer will allow
us to crack numbers in seconds. The quantum computer
can simultaneously do all the calculations mentioned
in method (1) which a classical computer must
do one at a time.
Prime numbers actually helped create the first
code that could be used globally on the Internet
and didn’t need secret agents.
|
