arXiv CS
open access
Regular Syndrome Decoding Is Easier Than Previously Estimated
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 general
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Regular Syndrome Decoding Is Easier Than Previously Estimated#1413416
- A Sequence Sensitive Model of Encoding Precision#313355
- A string encoding of Presentation Address#153154
- Unsupervised Domain Adaptation for Symbol Spotting in Historical Encrypted Manuscripts#975215
- A Quantum Approach For Reducing Communications in Classical Secure Computations with Long Outputs#1389024
Record · ID 1406394
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive