Bibliographic Details
| Title: |
Two modifications for Loidreau's code-based cryptosystem. |
| Authors: |
Guo, Wenshuo, Fu, Fang-Wei |
| Source: |
Applicable Algebra in Engineering, Communication & Computing; Sep2024, Vol. 35 Issue 5, p647-665, 19p |
| Subject Terms: |
LOW-rank matrices, RANDOM matrices, CRYPTOGRAPHY |
| Abstract: |
This paper presents two modifications for Loidreau's cryptosystem, a rank metric-based cryptosystem constructed by using Gabidulin codes in the McEliece setting. Recently a polynomial-time key recovery attack was proposed to break this cryptosystem in some cases. To prevent this attack, we propose the use of subcodes to disguise the secret codes in Modification I. In Modification II, we choose a random matrix of low column rank to mix with the secret matrix. Our analysis shows that these two modifications can both resist the existing structural attacks. Furthermore, these modifications have a much more compact representation of public keys compared to Classic McEliece, which has been selected into the fourth round of the NIST-PQC project. [ABSTRACT FROM AUTHOR] |
|
Copyright of Applicable Algebra in Engineering, Communication & Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science