BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260905T051821Z
UID:https://www.ipp.mpg.de/events/18124/4806358
DTSTART:20191129T093000Z
DTEND:20191129T110000Z
CLASS:PUBLIC
CREATED:20190320T164756Z
DESCRIPTION:Public-key cryptography (PKC) is the foundation for establishin
 g secure communication between multiple parties. PKC relies on a public ke
 y\, known to everyone\, and a private key\, generated and known only to on
 e party\, the intended receiver.Traditional PKC algorithms such as the Riv
 est-Shamir-Adleman (RSA) cryptosystem\, whose hardness is based on the fac
 torization of larger numbers\, or Elliptic Curve Cryptography (ECC)\, whic
 h is based on the discrete logarithm problem\, are considered insecure to 
 attacks performed by a quantum computer. Post-quantum cryptography therefo
 re relies on algorithms based on mathematical problems that are secure for
  attacks by traditional and quantum computers.This can be achieved in part
 icular 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 pre
 sented. It is based on a repair of the so-called Faure-Loidreau system and
  provides significantly smaller key sizes than\, e.g.\, the McEliece syste
 m based on Goppa codes for the same security level.Second\, two further co
 de-based cryptosystems and their implications are presented: a system base
 d 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.\nVortr
 agende(r): Prof. Antonia Wachter-Zeh
LAST-MODIFIED:20191120T131552Z
LOCATION:Garching und Greifswald\, Raum: Hörsaal D2 (Übertragung nach HGW
  S1)
ORGANIZER;CN=IPP:mailto:
SUMMARY:Institutskolloquium: Coding for Security and Storage
URL;VALUE=URI:https://www.ipp.mpg.de/events/18124/4806358
END:VEVENT
END:VCALENDAR