MSc graduate

AG 1, AG 2, AG 3, INET, AG 4, AG 5, SWS, RG1, MMCI   Info

Public Audience

English

60 Minutes

Saarbrücken

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.

Stephanie Jörg

0681 93251800

--email hidden

passcode not visible

logged in users only