Citation
Lau, Terry Shue Chien and Ivanov, Fedor and Ariffin, Muhammad Rezal Kamel and Chin, Ji Jian and Yap, Timothy Tzen Vun (2023) New code-based cryptosystems via the IKKR framework. Journal of Information Security and Applications, 76. p. 103530. ISSN 2214-2126
Text
10.pdf - Published Version Restricted to Repository staff only Download (654kB) |
Abstract
One main construct for code-based public key cryptosystems is the McEliece framework that hedges upon the hardness of decoding arbitrary linear codes. Based on Goppa codes, the original McEliece cryptosystem however, suffers from having very large public keys. To alleviate this problem, we define a new problem that is NP-complete and use this assumption of the intractability of the decisional problem to construct a IND-CCA2-secure code-based public key encryption scheme. We consider generalized Reed–Solomon codes in our public-key cryptosystem and show that it resists Sidelnikov and Shestakov’s key recovery attack. Our generalized Reed–Solomon code encryption scheme achieves optimal public key size when compared with other PKE or key encapsulation mechanisms with deterministic decryption or decapsulation, as it requires only 88.1 kilobytes to store public key for schemes achieving 128-bit security level and 399.69 kilobytes to store public key for schemes achieving 256-bit security level. A public key size reduction of nearly 92% is obtained as compared to the classic McEliece PKE, and nearly 53% compared to the Reed–Solomon code-based PKE.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Cryptography |
Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD9000-9999 Special industries and trades |
Divisions: | Faculty of Computing and Informatics (FCI) |
Depositing User: | Ms Nurul Iqtiani Ahmad |
Date Deposited: | 28 Jul 2023 06:40 |
Last Modified: | 28 Jul 2023 06:40 |
URII: | http://shdl.mmu.edu.my/id/eprint/11559 |
Downloads
Downloads per month over past year
Edit (login required) |