McNie2-Gabidulin: An improvement of McNie public key encryption using Gabidulin code
Jon-Lark Kim, Young-Sik Kim, Lucky Galvez, Myeong Jae Kim

TL;DR
This paper introduces McNie2-Gabidulin, an improved code-based public key encryption scheme that uses Gabidulin codes to eliminate decoding failures and offers enhanced security and smaller key sizes.
Contribution
It presents McNie2-Gabidulin, a novel cryptosystem that removes decoding failures in McNie by employing Gabidulin codes and proves its IND-CPA security.
Findings
Eliminates decoding failure in McNie using Gabidulin codes
Provides low key sizes with zero decryption failure probability
Proves IND-CPA security of the new cryptosystem
Abstract
McNie is a code-based public key encryption scheme submitted as a candidate to the NIST Post-Quantum Cryptography standardization. In this paper, we present McNie2-Gabidulin, an improvement of McNie. By using Gabidulin code, we eliminate the decoding failure, which is one of the limitations of the McNie public key cryptosystem that uses LRPC codes. We prove that this new cryptosystem is IND-CPA secure. Suggested parameters are also given which provides low key sizes compared to other known code based cryptosystems with zero decryption failure probability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptographic Implementations and Security · graph theory and CDMA systems
