New McEliece cryptosystem based on polar codes as a candidate for post-quantum cryptography
Sujan Raj Shrestha, Young Sik Kim · 2014
It is known that the widely used public key cryptosystems such as RSA and elliptic curve cryptography can be broken by using a specific computation in quantum computers. Currently, since quantum computers which can deal with practical length of parameters are not realized yet, we may still use the famous cryptographic algorithms. However, we need to prepare and deeply study the alternatives of these algorithms before the realization of the practical quantum computers and this line of research is called as the `post-quantum cryptography (PQC).' In this paper, we study a candidate of post-quantum cryptography, a new version of McEliece crypto-system based on polar codes, which are recently proposed promising error correcting codes in many applications.