Regular Syndrome Decoding Is Easier Than Previously Estimated↗ (원문, 새 창)

본문 미리보기

arXiv:2610.29175v1 Announce Type: new Abstract: The Regular Syndrome Decoding (RSD) problem is a structured variant of classical Syndrome Decoding and underlies a growing number of efficient cryptographic constructions, including zero knowledge protocols, pseudorandom correlation generators, and MPC in the Head signatures. Although RSD is generally believed to be computationally hard, recent works have shown that algebraic attacks can outperform information set decoding on important RSD paramet