Post
Topic
Board Development & Technical Discussion
Re: Mathematical Shortcuts To Hashing
by
bluemeanie1
on 18/06/2013, 16:15:58 UTC
But you could turn it around into finding factors of a very large number to check whether it is prime.

Couldn't you just lie about this? Imagine "15" is such a huge number: I just claim that the only factors I could find for 15 are 1 and 15, thus making it prime. This still requires you to try to find other factors to debunk my claim...



A large number is proposed and everybody keeps dividing it by various primes until somebody gets lucky and finds a factor. It takes a lot of computational power to keep dividing but when you have found a factor anybody can quickly check whether it actually is a factor.



these problems lie at the basis of the RSA function itself: http://en.wikipedia.org/wiki/RSA_%28algorithm%29#Integer_factorization_and_RSA_problem