Header

UZH-Logo

Maintenance Infos

Security of generalised Reed–Solomon code-based cryptosystems


Baldi, Marco; Chiaraluce, Franco; Rosenthal, Joachim; Santini, Paolo; Schipani, Davide (2019). Security of generalised Reed–Solomon code-based cryptosystems. IET Information Security, 13(4):404-410.

Abstract

In this study, the authors elaborate on a recently proposed variant of the public-key McEliece and Niederreiter cryptosystems using generalised Reed–Solomon (GRS) codes as private codes. The use of these codes brings known advantages in terms of public key size, but particular care is needed in the choice of parameters not to endanger the system security. In fact, the considered system exploits a strong disguising technique of the private code within the public code. However, it has recently been pointed out that some new attacks exist which may threaten some instances of such a system, therefore the choice of parameters needs to consider some further constraints compared to the original version. After outlining these constraints, the authors propose a new modification of the system achieving greater flexibility in the parameter choice. Moreover, the new system exhibits a lower complexity than the original GRS code-based system. Its very competitive features such as key size and encryption rate are highlighted with respect to classic systems.

Abstract

In this study, the authors elaborate on a recently proposed variant of the public-key McEliece and Niederreiter cryptosystems using generalised Reed–Solomon (GRS) codes as private codes. The use of these codes brings known advantages in terms of public key size, but particular care is needed in the choice of parameters not to endanger the system security. In fact, the considered system exploits a strong disguising technique of the private code within the public code. However, it has recently been pointed out that some new attacks exist which may threaten some instances of such a system, therefore the choice of parameters needs to consider some further constraints compared to the original version. After outlining these constraints, the authors propose a new modification of the system achieving greater flexibility in the parameter choice. Moreover, the new system exhibits a lower complexity than the original GRS code-based system. Its very competitive features such as key size and encryption rate are highlighted with respect to classic systems.

Statistics

Citations

Altmetrics

Downloads

0 downloads since deposited on 13 Dec 2019
0 downloads since 12 months

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Uncontrolled Keywords:Computer Networks and Communications, Software, Information Systems
Language:English
Date:1 July 2019
Deposited On:13 Dec 2019 15:03
Last Modified:28 Feb 2020 08:24
Publisher:The Institution of Engineering and Technology
ISSN:1751-8717
OA Status:Closed
Publisher DOI:https://doi.org/10.1049/iet-ifs.2018.5207

Download

Closed Access: Download allowed only for UZH members

Content: Published Version
Language: English
Filetype: PDF - Registered users only
Size: 817kB
View at publisher