A tiny public key scheme based on Niederreiter Cryptosystem
Arash Khalvan, Amirhossein Zali, Mahmoud Ahmadian Attari

TL;DR
This paper introduces a compact public key cryptosystem based on Niederreiter, offering shorter keys and comparable security, addressing practicality issues of traditional code-based cryptosystems in the post-quantum era.
Contribution
It proposes a new, simple, and implementable code-based cryptosystem with significantly shorter public keys than existing NIST finalists, maintaining strong security.
Findings
Public key length reduced to 18-500 bits for standard parameters
Security comparable to Niederreiter cryptosystem
Suitable for implementation in existing systems
Abstract
Due to the weakness of public key cryptosystems encounter of quantum computers, the need to provide a solution was emerged. The McEliece cryptosystem and its security equivalent, the Niederreiter cryptosystem, which are based on Goppa codes, are one of the solutions, but they are not practical due to their long key length. Several prior attempts to decrease the length of the public key in code-based cryptosystems involved substituting the Goppa code family with other code families. However, these efforts ultimately proved to be insecure. In 2016, the National Institute of Standards and Technology (NIST) called for proposals from around the world to standardize post-quantum cryptography (PQC) schemes to solve this issue. After receiving of various proposals in this field, the Classic McEliece cryptosystem, as well as the Hamming Quasi-Cyclic (HQC) and Bit Flipping Key Encapsulation…
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 · Quantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata
