A Novel Niederreiter-Like Cryptosystem Based on the (U|U Plus V)-Construction Codes

Abstract

In this paper, we present a new variant of the Niederreiter Public Key Encryption (PKE) scheme which is resistant against recent attacks. The security is based on the hardness of the Rank Syndrome Decoding (RSD) problem and it presents a (u vertical bar u + v)-construction code using two different types of codes: Ideal Low Rank Parity Check (ILRPC) codes and lambda-Gabidulin codes. The proposed encryption scheme benefits are a larger minimum distance, a new efficient decoding algorithm and a smaller ciphertext and public key size compared to the Loidreau's variants and to its IND-CCA secure version.