Cryptosystems for the future
Andreas Dresen (Uni Bonn)
Thursday, 5 June 2014, 15:00, b-it 1.25 (cosec meeting room)
Today's public key cryptosystems, like RSA or Diffie-Hellman, and also digital signature schemes, like ElGamal or DSA, are mainly based on two computational hard problems. These problems are on one hand the discrete logarithm problem and on the other hand the integer factorization problem. If quantum computers may arise or other attack procedures may be found, these cryptosystems and digital signature schemes could be someday attackable.
This talk wants to give an overview of some old and newly public key cryptosystems and digital signature schemes, in particular on hash-based schemes like Merkle signatures, which should be still secure if someday discrete logarithm or integer factorization are broken. These "new" cryptosystems are based on different computational hard problems. For example, the closest vector problem in lattice-based schemes or ideas inspired by coding theory in case of code-based schemes. But on the other hand these cryptosystems also have some disadvantages. They are currently not yet used, because of these disadvantages.