- Bob calculates a private and public key.
- Bob sends his public key to John.
- Jeff is a third party unwanted member and manages to snatch the public key mid-transfer.
- John encrypts his message and sends it to Bob.
- Jeff again is able to steal this encrypted message for himself.
- Bob can decrypt the message with his private key.
But what about Jeff? So he can't decrypt using the one-way key. But what if he brutes it? So for example John's original value was 2 and the encrypted value is now let's say 200. Jeff can now just count upwards from 1 and encrypt all values with the public key until it matches the value of 200. He finds 2 matches that. So now he has the original value.
I know it's not that simple and easy and it might not even work at all on a real RSA standard but I want to know what the procedure is for stopping this sort of attack.