McEliece-type CryptosysteMS over Quasi-cyclic Codes

Abstract

Most of the cryptosystems that we use today, are based on hardness of factoring or discrete log in one way or other. As soon as quantum computers become reality, such systems will break down. In this work, we suggest a Niederreiter cryptosystem over quasi-cyclic codes which is secure against current known attacks, both classical and quantum. We give an algorithm for construction of such codes.