Niederreiter-style scheme uses masked convolutional codes
Original title: Syndrome Trellis Decryption in Post-Quantum Cryptography
Authors claim security margins more than 2^200 above classical McEliece and Niederreiter estimates, with linear-time decryption.
The paper proposes a post-quantum public-key construction in the Niederreiter paradigm based on masked high-memory convolutional codes. The public key is a high-memory polynomial parity-check matrix plus dense random masking and invertible linear transforms. Legitimate decoding stays polynomial-time via parallel syndrome-trellis decoders, while attackers are argued to face generic information-set decoding. The design allows arbitrary plaintext lengths and a uniform per-bit cost.
Unconfirmed: The security-margin figures are the authors' estimates under standard cryptanalytic assumptions.
- Claimed margins exceed classical McEliece and Niederreiter systems by more than 2^200.
- Decryption is described as linear-time with a uniform per-bit cost.
- Syndrome-trellis decoders are created from candidate syndrome values.
- The security case uses standard cryptanalytic estimates rather than a completed proof.
From the original article
1 min read at arxiv.orgWe present a novel post-quantum cryptographic framework based on masked high-memory convolutional codes in the Niederreiter paradigm. The public key is derived from a high-memory polynomial parity-check matrix augmented by dense random masking and additional invertible linear transformations.
By Meir Ariel · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.