this brushs up against a well known unsolved problem of p vs np. i wont get into it but it basically means. if something is easily verified, can it be also easily solved.
an example is this. what is the solution to 3×7. it is 21. it is very easy to find the answer and verify if it is correct.
what if i changed the question to this. what are 2 prime numbers that multiple into 21. the question got suddenly alot harder to solve.
the essence of encryption is based on the second question. numbers that are hard to solve but very easy to verify if the answer is correct. but with numbers that are way way longer.
we basically encrypt our messages with the very large number, and send it to the other person who has the answers. how they can send it is beyond this.
Latest Answers