{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BWVGVLELNBUHEYHM3GPURONBMK","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":"3ab5f8ee59128311fa0e0c70421085da1a506c6187ec8f4323a745a655b7a982","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-12-16T17:58:48Z","title_canon_sha256":"49e5f665296247a1bdafd671aa8b6f40c5b2bbbc3169b966681d960c0b8af277"},"schema_version":"1.0","source":{"id":"1612.05572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05572","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05572v1","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05572","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"pith_short_12","alias_value":"BWVGVLELNBUH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BWVGVLELNBUHEYHM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BWVGVLEL","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:b91bb20e3874ae6ad4b03cc89c8663cf3f5eb9273cce9aea43b7a52c8ebe7f6b","target":"graph","created_at":"2026-05-18T00:54:51Z","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":"We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based on the difficulty of decoding random linear codes from random errors of low weight. We depart somewhat from Aleknovich's approach and propose an encryption scheme based on the difficulty of decoding random quasi-cyclic codes. We propose two new cryptosystems instantiated within our framework: the Hamming Quasi-Cyclic cryptosystem (HQC), based on the Hamming ","authors_text":"Carlos Aguilar, Gilles Z\\'emor, Jean-Christophe Deneuville, Olivier Blazy, Philippe Gaborit","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-12-16T17:58:48Z","title":"Efficient Encryption from Random Quasi-Cyclic Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05572","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:b0bb732d303b2dbe29f2cb9b0a77e4e4fd50a418aef5c16165e73833e8c09118","target":"record","created_at":"2026-05-18T00:54:51Z","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":"3ab5f8ee59128311fa0e0c70421085da1a506c6187ec8f4323a745a655b7a982","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-12-16T17:58:48Z","title_canon_sha256":"49e5f665296247a1bdafd671aa8b6f40c5b2bbbc3169b966681d960c0b8af277"},"schema_version":"1.0","source":{"id":"1612.05572","kind":"arxiv","version":1}},"canonical_sha256":"0daa6aac8b68687260ecd99f48b9a1628c438afc536c0cc2bacaeff87c716488","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0daa6aac8b68687260ecd99f48b9a1628c438afc536c0cc2bacaeff87c716488","first_computed_at":"2026-05-18T00:54:51.513127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:51.513127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MBrPNFbqvzjt3ECyGTYpDNHR64quP87qFW7W05ZLGbxiv+Zx7rDss+0y7b4RYwUpTwxBIxf1E8C8thKN5kriDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:51.513589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0bb732d303b2dbe29f2cb9b0a77e4e4fd50a418aef5c16165e73833e8c09118","sha256:b91bb20e3874ae6ad4b03cc89c8663cf3f5eb9273cce9aea43b7a52c8ebe7f6b"],"state_sha256":"f040f294d1dfb1a461fae915d6b38d5d4bb8f17293e39edffa18f6f8e5ad2eb6"}