Abstract
Public-key cryptography is the foundation for establishing secure communication between multiple parties. Traditional public-key algorithms such as RSA are based on the hardness of factoring large numbers or the discrete logarithm problem, but can be attacked in polynomial time once a capable quantum computer exists. Code-based public-key cryptosystems are considered to be post-quantum secure, but compared to RSA or elliptic curve cryptography their crucial drawback is the significantly larger key size. In order reduce key sizes, (interleaved) rank-metric codes can be used in code-based cryptography. In this talk, we first give an overview of interleaving and decoding algorithms in the Hamming and rank metric and then present different approaches to define code-based cryptographic schemes.