All Questions
1
question
3
votes
3
answers
567
views
can it be proven that something is "difficult" (prime factoring for example)
I understand that the current state of the art suggests that factoring into primes is a difficult problem. I also understand that a large part of public key cryptography seems to be based on that ...