Code-based cryptography & brute-forcing McEliece keys

In this talk I will give a high-level overview of how linear codes are employed as a source of computationally hard problems in cryptography, complemented by recent theoretical and practical results on the hardness of key-recovery attacks on the McEliece public-key encryption scheme.