Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

New for: D1, D2, D3, D4, D5
<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Could code based cryptosystems be more compact?
Speaker:Upendra Kapshikar
coming from:Indian Institute of Science Education and Research (IISER), Pune
Speakers Bio:MSc graduate
Event Type:PhD Application Talk
Visibility:D1, D2, D3, INET, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:Public Audience
Date, Time and Location
Date:Monday, 8 October 2018
Duration:60 Minutes
Building:E1 5
Many of the popular public key cryptosystems are built upon commutative algebraic structures eg. RSA over Z/pqZ. Often it's security is tied to a computationally 'difficult problem‘ eg. Factorisation over integers for RSA, discrete log for ElGamal. With the rise of Shor's quantum algorithm, these problems are no more difficult and thus security of corresponding cryptosystems is strongly attacked. This calls for investigation for cryptosystems over non commutative structures. We will look into one such cryptosystem - Niederreiter Cryptosystem. We briefly look into drawbacks of the current system with goppa codes. We propose a new variant of the system over quasicyclic codes and we will discuss it's connection with a certain combinatorial optimisation problem. We will follow it up with one of the possible solutions to this problem establishing security of this systems against Shor-like algorithms.
Name(s):Stephanie Jörg
Phone:0681 93251800
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
Stephanie Jörg/MPI-INF, 10/05/2018 12:18 PM
Last modified:
Stephanie Jörg/MPI-INF, 10/08/2018 09:41 AM
  • Stephanie Jörg, 10/08/2018 09:42 AM
  • Stephanie Jörg, 10/05/2018 12:22 PM -- Created document.