Search
Workshop

Code-based cryptography & brute-forcing McEliece keys

  • Lorenz Panny (Technische Universität München)
E1 05 (Leibniz-Saal)

Abstract

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.

Saskia Gutzschebauch

Max Planck Institute for Mathematics in the Sciences Contact via Mail

Mirke Olschewski

Max Planck Institute for Mathematics in the Sciences Contact via Mail

Anne Frühbis-Krüger

Carl von Ossietzky Universität Oldenburg

Alheydis Geiger

Max Planck Institute for Mathematics in the Sciences

Max Horn

Rheinland-Pfälzische Technische Universität Kaiserslautern-Landau