A Statistical Decoding Algorithm for General Linear Block Codes
From MaRDI portal
Publication:4550247
DOI10.1007/3-540-45325-3_1zbMath0999.94531OpenAlexW2149839186MaRDI QIDQ4550247
Publication date: 2 December 2002
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45325-3_1
cryptanalysiserror locationsMcEliece public-key cryptosystemgeneral linear block codesstatistical decoding algorithm
Related Items
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Generalization of the Ball-Collision Algorithm ⋮ Using low-density parity-check codes to improve the McEliece cryptosystem ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ Does the dual-sieve attack on learning with errors even work? ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes ⋮ Statistical decoding 2.0: reducing decoding to LPN ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Expand-convolute codes for pseudorandom correlation generators from LPN ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Statistical Decoding of Codes over $\mathbb{F}_q$
