Expanded low-rank parity-check codes and their application to cryptography.
Saved in:
| Title: | Expanded low-rank parity-check codes and their application to cryptography. |
|---|---|
| Authors: | Franck Rivel, Kamwa Djomou, Emmanuel, Fouotsa, Calvin, Tadmon |
| Source: | Cryptologia; Jul2024, Vol. 48 Issue 4, p323-351, 29p |
| Subject Terms: | CRYPTOGRAPHY, CRYPTOSYSTEMS, LINEAR codes, PUBLIC key cryptography, DECODING algorithms |
| Abstract: | In this paper, we define expanded LRPC codes from LRPC codes with a decoding algorithm using the one of the underlying LRPC codes. Next, we propose to use these codes for cryptography by deriving two cryptosystems in a McEliece setting. in order to reduce the key sizes, we use a generator matrix in systematic form for the first scheme, and an m − order quasi-cyclic LRPC code that we define for the second scheme. The obtained code has a very poor structure and is more likely to be a random linear code. Next, we give some security parameters and compare the key sizes of our public key with the key sizes of some cryptosystems. [ABSTRACT FROM AUTHOR] |
| Copyright of Cryptologia is the property of Taylor & Francis Ltd 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 Be the first to leave a comment!