Coding for Security and Storage
- Datum: 29.11.2019
- Uhrzeit: 10:30 - 12:00
- Vortragende(r): Prof. Antonia Wachter-Zeh
- Ort: Garching und Greifswald
- Raum: Hörsaal D2 (Übertragung nach HGW S1)
- Gastgeber: IPP
Public-key cryptography (PKC) is the foundation for establishing secure communication between multiple parties. PKC relies on a public key, known to everyone, and a private key, generated and known only to one party, the intended receiver.Traditional PKC algorithms such as the Rivest-Shamir-Adleman (RSA) cryptosystem, whose hardness is based on the factorization of larger numbers, or Elliptic Curve Cryptography (ECC), which is based on the discrete logarithm problem, are considered insecure to attacks performed by a quantum computer. Post-quantum cryptography therefore relies on algorithms based on mathematical problems that are secure for attacks by traditional and quantum computers.This can be achieved in particular by code-based cryptosystems which are the focus of this talk.First, a system based on the hardness of list decoding rank-metric codes is presented. It is based on a repair of the so-called Faure-Loidreau system and provides significantly smaller key sizes than, e.g., the McEliece system based on Goppa codes for the same security level.Second, two further code-based cryptosystems and their implications are presented: a system based on interleaved Goppa codes and a system based on twisted Gabidulin codes.Third, an overview of our further recent work in coding for distributed storage, DNA storage, and private information retrieval is given.