{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4YAQ4PEYUAELPYU53ENV5EL2R7","short_pith_number":"pith:4YAQ4PEY","schema_version":"1.0","canonical_sha256":"e6010e3c98a008b7e29dd91b5e917a8fd32b447085e3ad5b89a321998bfb2ac5","source":{"kind":"arxiv","id":"1301.1026","version":1},"attestation_state":"computed","paper":{"title":"On the complexity of the Rank Syndrome Decoding problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Julien Schrek, Olivier Ruatta, Philippe Gaborit","submitted_at":"2013-01-06T16:56:53Z","abstract_excerpt":"In this paper we propose two new generic attacks on the Rank Syndrome Decoding (RSD) problem\n  Let $C$ be a random $[n,k]$ rank code over $GF(q^m)$ and let $y=x+e$ be a received word such that $x \\in C$ and the $Rank(e)=r$. The first attack is combinatorial and permits to recover an error $e$ of rank weight $r$ in $min(O((n-k)^3m^3q^{r\\lfloor\\frac{km}{n}\\rfloor}, O((n-k)^3m^3q^{(r-1)\\lfloor\\frac{(k+1)m}{n}\\rfloor}))$ operations on $GF(q)$. This attack dramatically improves on previous attack by introducing the length $n$ of the code in the exponent of the complexity, which was not the case in "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1301.1026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-06T16:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"b96c6070a34285ca15da6876a8fdf44f5867a0089d04cac7e49c313a36b5bfd1","abstract_canon_sha256":"c8418a289720bab10d46360bd23459028b061a4dacb3b33e2b45eb974da72488"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:06.963560Z","signature_b64":"/fNPqB0yiwO/yrAupscDEPZv9qBaUwYOXVD1Q+zwN34qk1bUu0fQZ261oguUjEYYzbfD8NLg8nHjyKb4zlWlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6010e3c98a008b7e29dd91b5e917a8fd32b447085e3ad5b89a321998bfb2ac5","last_reissued_at":"2026-05-18T03:37:06.962809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:06.962809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of the Rank Syndrome Decoding problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Julien Schrek, Olivier Ruatta, Philippe Gaborit","submitted_at":"2013-01-06T16:56:53Z","abstract_excerpt":"In this paper we propose two new generic attacks on the Rank Syndrome Decoding (RSD) problem\n  Let $C$ be a random $[n,k]$ rank code over $GF(q^m)$ and let $y=x+e$ be a received word such that $x \\in C$ and the $Rank(e)=r$. The first attack is combinatorial and permits to recover an error $e$ of rank weight $r$ in $min(O((n-k)^3m^3q^{r\\lfloor\\frac{km}{n}\\rfloor}, O((n-k)^3m^3q^{(r-1)\\lfloor\\frac{(k+1)m}{n}\\rfloor}))$ operations on $GF(q)$. This attack dramatically improves on previous attack by introducing the length $n$ of the code in the exponent of the complexity, which was not the case in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1026","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.1026","created_at":"2026-05-18T03:37:06.962933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1026v1","created_at":"2026-05-18T03:37:06.962933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1026","created_at":"2026-05-18T03:37:06.962933+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YAQ4PEYUAEL","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YAQ4PEYUAELPYU5","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YAQ4PEY","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7","json":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7.json","graph_json":"https://pith.science/api/pith-number/4YAQ4PEYUAELPYU53ENV5EL2R7/graph.json","events_json":"https://pith.science/api/pith-number/4YAQ4PEYUAELPYU53ENV5EL2R7/events.json","paper":"https://pith.science/paper/4YAQ4PEY"},"agent_actions":{"view_html":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7","download_json":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7.json","view_paper":"https://pith.science/paper/4YAQ4PEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1026&json=true","fetch_graph":"https://pith.science/api/pith-number/4YAQ4PEYUAELPYU53ENV5EL2R7/graph.json","fetch_events":"https://pith.science/api/pith-number/4YAQ4PEYUAELPYU53ENV5EL2R7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/action/storage_attestation","attest_author":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/action/author_attestation","sign_citation":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/action/citation_signature","submit_replication":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/action/replication_record"}},"created_at":"2026-05-18T03:37:06.962933+00:00","updated_at":"2026-05-18T03:37:06.962933+00:00"}