Skip to content

Back to the catalog

Regular Syndrome Decoding Is Easier Than Previously Estimated
eprint.iacr.orgpaper

Regular Syndrome Decoding Is Easier Than Previously Estimated

Preprint 2026/2563 presents a refined hybrid-algebraic attack on Regular Syndrome Decoding (RSD) that balances zero-coordinate guesses and syndrome-based eliminations across all regular blocks. It puts at least one parameter set each from Ferret (CCS 2020), Wolverine (IEEE S&P 2021) and committed VOLE (CCS 2025) below the 128-bit target, with losses up to 67 bits. PCG attack costs improve by up to 29.77 bits (non-binary) and 25.91 bits (binary), and the revised Liu et al. (EUROCRYPT 2024) 128-bit sets fall below 2^111 field operations.

TL;DR Shows a block-balanced hybrid algebraic attack breaks the claimed 128-bit security of several RSD-based Ferret, Wolverine and committed VOLE parameter sets by up to 67 bits.
Open original ↗

Organisations named here

  • committed VOLE
  • information-set decoding
  • linearization
  • MPC-in-the-Head
  • pseudorandom correlation generator
  • Regular Syndrome Decoding

Technologies named here

  • Ferret
  • Wolverine
  • Committed VOLE
  • RSD-based constructions generally

Techniques named here

  • Result on PCG benchmarks

Related in other