{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DTGF5PYY2RMGELGA7ZAXGR7GHD","short_pith_number":"pith:DTGF5PYY","schema_version":"1.0","canonical_sha256":"1ccc5ebf18d458622cc0fe417347e638df08bda79fee900d4991896c4102cd10","source":{"kind":"arxiv","id":"1501.03736","version":1},"attestation_state":"computed","paper":{"title":"A Polynomial-Time Attack on the BBCRS Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich, Val\\'erie Gauthier-Umana","submitted_at":"2015-01-15T16:40:27Z","abstract_excerpt":"The BBCRS scheme is a variant of the McEliece public-key encryption scheme where the hiding phase is performed by taking the inverse of a matrix which is of the form $\\mathbf{T} +\\mathbf{R}$ where $\\mathbf{T}$ is a sparse matrix with average row/column weight equal to a very small quantity $m$, usually $m < 2$, and $\\mathbf{R}$ is a matrix of small rank $z\\geqslant 1$. The rationale of this new transformation is the reintroduction of families of codes, like generalized Reed-Solomon codes, that are famously known for representing insecure choices. We present a key-recovery attack when $z = 1$ a"},"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":"1501.03736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-15T16:40:27Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"578bde5c78c609aafe1d92519e002dca08594fec8f172879497d6c109259d86a","abstract_canon_sha256":"059666db9da63779197ba016a66b437520ec86dcc4c7b387707b051799e8e870"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:17.928631Z","signature_b64":"Cq/fBLbISAQ04Dnf3+G8Nbpdq5g8Iss1BvcYpKiaQktngkPl4yubyR9PIqWhbpEcUJj9Dz+hn/BW5bfMwUBXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ccc5ebf18d458622cc0fe417347e638df08bda79fee900d4991896c4102cd10","last_reissued_at":"2026-05-18T02:29:17.928245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:17.928245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial-Time Attack on the BBCRS Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich, Val\\'erie Gauthier-Umana","submitted_at":"2015-01-15T16:40:27Z","abstract_excerpt":"The BBCRS scheme is a variant of the McEliece public-key encryption scheme where the hiding phase is performed by taking the inverse of a matrix which is of the form $\\mathbf{T} +\\mathbf{R}$ where $\\mathbf{T}$ is a sparse matrix with average row/column weight equal to a very small quantity $m$, usually $m < 2$, and $\\mathbf{R}$ is a matrix of small rank $z\\geqslant 1$. The rationale of this new transformation is the reintroduction of families of codes, like generalized Reed-Solomon codes, that are famously known for representing insecure choices. We present a key-recovery attack when $z = 1$ a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03736","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":"1501.03736","created_at":"2026-05-18T02:29:17.928300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03736v1","created_at":"2026-05-18T02:29:17.928300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03736","created_at":"2026-05-18T02:29:17.928300+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTGF5PYY2RMG","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTGF5PYY2RMGELGA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTGF5PYY","created_at":"2026-05-18T12:29:17.054201+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/DTGF5PYY2RMGELGA7ZAXGR7GHD","json":"https://pith.science/pith/DTGF5PYY2RMGELGA7ZAXGR7GHD.json","graph_json":"https://pith.science/api/pith-number/DTGF5PYY2RMGELGA7ZAXGR7GHD/graph.json","events_json":"https://pith.science/api/pith-number/DTGF5PYY2RMGELGA7ZAXGR7GHD/events.json","paper":"https://pith.science/paper/DTGF5PYY"},"agent_actions":{"view_html":"https://pith.science/pith/DTGF5PYY2RMGELGA7ZAXGR7GHD","download_json":"https://pith.science/pith/DTGF5PYY2RMGELGA7ZAXGR7GHD.json","view_paper":"https://pith.science/paper/DTGF5PYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03736&json=true","fetch_graph":"https://pith.science/api/pith-number/DTGF5PYY2RMGELGA7ZAXGR7GHD/graph.json","fetch_events":"https://pith.science/api/pith-number/DTGF5PYY2RMGELGA7ZAXGR7GHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTGF5PYY2RMGELGA7ZAXGR7GHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTGF5PYY2RMGELGA7ZAXGR7GHD/action/storage_attestation","attest_author":"https://pith.science/pith/DTGF5PYY2RMGELGA7ZAXGR7GHD/action/author_attestation","sign_citation":"https://pith.science/pith/DTGF5PYY2RMGELGA7ZAXGR7GHD/action/citation_signature","submit_replication":"https://pith.science/pith/DTGF5PYY2RMGELGA7ZAXGR7GHD/action/replication_record"}},"created_at":"2026-05-18T02:29:17.928300+00:00","updated_at":"2026-05-18T02:29:17.928300+00:00"}