RAIRO-Theor. Inf. Appl.
Volume 55, 2021
|Number of page(s)||16|
|Published online||17 September 2021|
A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes
Faculty of Mathematics, USTHB, Laboratory of Algebraand Number Theory, BP 32 El Alia,
Bab Ezzouar, Algeria.
2 Univ Lyon, UJM-Saint-Etienne, CNRS, Laboratoire Hubert Curien UMR 5516, F-42023, Saint-Etienne, France.
3 Department of Computer Engineering, Faculty of Engineering, Ondokuz Mayis University, Samsun, Turkey.
* Corresponding author: firstname.lastname@example.org
Accepted: 29 July 2021
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|u + υ)-construction code using two different types of codes: Ideal Low Rank Parity Check (ILRPC) codes and λ-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.
Mathematics Subject Classification: 11T71 / 14G50
Key words: Niederreiter-PKE / ILRPC codes / λ-Gabidulin codes / rank-metric codes / IND-CCA security
© The authors. Published by EDP Sciences, 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.