Code based Cryptography had its beginning in 1978 when Robert McEliece
demonstrated how the hardness of decoding a general linear code up to
half the minimum distance can be used as the basis for a public key
crypto system. At the time the proposed system was not implemented in
practice as the required public key was relatively large.
With the realization that a quantum computer would make many
practically used systems obsolete coding based systems became an
important research subject in the area of post-quantum cryptography.
In this talk we will provide an overview to the subject.
In addition we will report on recent results where the underlying
code is a disguised Gabidulin code or more generally a subspace
code and where the distance measure is the rank metric respecively the
- Cryptography Seminar