{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DTGF5PYY2RMGELGA7ZAXGR7GHD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"059666db9da63779197ba016a66b437520ec86dcc4c7b387707b051799e8e870","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-15T16:40:27Z","title_canon_sha256":"578bde5c78c609aafe1d92519e002dca08594fec8f172879497d6c109259d86a"},"schema_version":"1.0","source":{"id":"1501.03736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03736","created_at":"2026-05-18T02:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03736v1","created_at":"2026-05-18T02:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03736","created_at":"2026-05-18T02:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"DTGF5PYY2RMG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DTGF5PYY2RMGELGA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DTGF5PYY","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:8c9679e2e15c40f3979f28ddb6a254d000bab9cbd5fc3afe269fdce23074e492","target":"graph","created_at":"2026-05-18T02:29:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich, Val\\'erie Gauthier-Umana","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-15T16:40:27Z","title":"A Polynomial-Time Attack on the BBCRS Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03736","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:602c6444c8ab721ee4e887eee29e746c136574e48d5720e3a0043eb3e36c547f","target":"record","created_at":"2026-05-18T02:29:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"059666db9da63779197ba016a66b437520ec86dcc4c7b387707b051799e8e870","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-15T16:40:27Z","title_canon_sha256":"578bde5c78c609aafe1d92519e002dca08594fec8f172879497d6c109259d86a"},"schema_version":"1.0","source":{"id":"1501.03736","kind":"arxiv","version":1}},"canonical_sha256":"1ccc5ebf18d458622cc0fe417347e638df08bda79fee900d4991896c4102cd10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ccc5ebf18d458622cc0fe417347e638df08bda79fee900d4991896c4102cd10","first_computed_at":"2026-05-18T02:29:17.928245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:17.928245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cq/fBLbISAQ04Dnf3+G8Nbpdq5g8Iss1BvcYpKiaQktngkPl4yubyR9PIqWhbpEcUJj9Dz+hn/BW5bfMwUBXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:17.928631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:602c6444c8ab721ee4e887eee29e746c136574e48d5720e3a0043eb3e36c547f","sha256:8c9679e2e15c40f3979f28ddb6a254d000bab9cbd5fc3afe269fdce23074e492"],"state_sha256":"e65f8caf8611232dde86cffec653087ced9c8abad89d69f5410b3b1a13a75487"}