Paper 2025/1149
An Efficient Encryption Scheme Based on $(U+V, U+W)$ Codes
Abstract
In this paper, we propose an improvement to the McEliece encryption scheme by replacing the Goppa code with a $(U+V,U+W)$ code. Specifically, we embed the generator matrices of a split Reed-Solomon code into the generator matrix of the $(U+V,U+W)$ code. This approach disrupts the algebraic structure of Reed-Solomon codes, thereby enhancing resistance against structural attacks targeting such codes, while simultaneously preserving their excellent error-correcting capabilities. As a result, the proposed scheme achieves a significant reduction in public key size. Under the hardness assumptions of the decoding problem and the code distinguishing problem for $(U+V,U+W)$ codes, we prove that the scheme achieves indistinguishability under chosen-plaintext attacks (IND-CPA security). Finally, we provide recommended parameters for various security levels and compare the proposed scheme with other code-based public key encryption schemes.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Code-based cryptography(U+V|U+W) codesReed-Solomon codePublic key encryptions
- Contact author(s)
-
1179916944 @ qq com
isszhfg @ mail sysu edu cn - History
- 2025-06-20: approved
- 2025-06-18: received
- See all versions
- Short URL
- https://ia.cr/2025/1149
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1149,
author = {Yang Yang and Fangguo Zhang},
title = {An Efficient Encryption Scheme Based on $(U+V, U+W)$ Codes},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1149},
year = {2025},
url = {https://eprint.iacr.org/2025/1149}
}
