Prof. Orr Dunkelman
How Breaking Encryption Schemes Taught Me How to Solve Rubik’s Cubes
The most generic attack against encryption schemes that exists is the brute force attack where the adversary tries all possible keys, one after the other. The easiest way to mitigate this attack is to ensure that the key length is sufficiently long, alas some schemes still use a short key.
The easiest way to transform a short key into a long one is by encrypting multiple times, i.e., encrypt the message once, and take the result and encrypt it again (under another key).
In this talk we will shortly show how to treat such multiple encryption schemes, offering new (and improved) attacks. We will then show how to use those ideas to solve Rubik cubes in the smallest possible number of steps.