Syndrome Trellis Decryption in Post-Quantum Cryptography

A new cryptographic framework uses masked high-memory convolutional codes in the Niederreiter paradigm.

Researchers presented a post-quantum cryptographic framework. It is based on masked high-memory convolutional codes in the Niederreiter paradigm.

The public key comes from a high-memory polynomial parity-check matrix. This matrix uses dense random masking and additional invertible linear transformations.

The resulting matrix has strong random-like properties. These properties conceal its algebraic structure and resist known structural and algebraic attacks.

Legitimate recipients have polynomial-time decoding capability. Adversaries appear to be limited to generic information-set decoding with exponential complexity.

The construction achieves security margins exceeding classical McEliece- and Niederreiter-based systems. These margins are greater by factors more than 22002^{200}.

The scheme supports arbitrary plaintext lengths and linear-time decryption. It uses a parallel array of syndrome-trellis decoders for efficient implementation.

Key facts

  • Security margins exceed classical McEliece- and Niederreiter-based systems by factors greater than 22002^{200}.
  • The framework supports arbitrary plaintext lengths and linear-time decryption.
  • Implementation uses a parallel array of syndrome-trellis decoders.

All sections

Edition