VIDEO Cryptography
Cryptography relies on computational asymmetry. It needs problems with an easy direction (the problem the “good guy”, i.e. the encryptor, must solve) and a hard one (the problem the “bad guy” should solve to decrypt information). “The kind of computational hardness we need for public-key cryptography is hard to come by, and in 45 years we only have found a handful of candidate hard problems,” says Professor Alon Rosen, who obtained a €2.49mln ERC Advanced Grant to try and find problems with such a computational asymmetry.