I am struggling to understand how one is fast enough to underly the entire internet and how the other is so slow as to be functionally impossible.
As an expansion, since the public key is known, how then is the encrypted message irreversible?
In: 4
hashes are a fixed size.128, 256, etc bits for any length of input data. They are one-way function, multiple inputs can map to the same hash (but ideally very rare). It is ‘lossy’ in the terms of image compression. Information is lost.
Look at modulo (division remainder). 4+9 mod 7 = 13 mod 7 = 6
But also 21+6 mod 7 would == 6 as well, and 2+4 mod 7 etc
Encrypted data will be the same length as the input (assuming the algorithm doesn’t compress as well).
And if you do want compression you want to compress before you encrypt. Since compression looks for common patterns in the input, while encrypted data looks random, there are no common runs of identical strings or bytes.
Latest Answers