{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HT7M7FX6KJFEEVMSC7Q5M7W6I2","short_pith_number":"pith:HT7M7FX6","schema_version":"1.0","canonical_sha256":"3cfecf96fe524a42559217e1d67ede46b124d21312c60f7ce6b0b77e79d48dba","source":{"kind":"arxiv","id":"1801.07484","version":1},"attestation_state":"computed","paper":{"title":"Protograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Gianluigi Liva, Hannes Bartz","submitted_at":"2018-01-23T11:11:32Z","abstract_excerpt":"In this paper, ensembles of quasi-cyclic moderate-density parity-check (MDPC) codes based on protographs are introduced and analyzed in the context of a McEliece-like cryptosystem. The proposed ensembles significantly improve the error correction capability of the regular MDPC code ensembles that are currently considered for post-quantum cryptosystems without increasing the public key size. The proposed ensembles are analyzed in the asymptotic setting via density evolution, both under the sum-product algorithm and a low-complexity (error-and-erasure) message passing algorithm. The asymptotic 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":"1801.07484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T11:11:32Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"69ba4735ac46a1bbeb97a9d69fcd63ad0b7f694d1cec45bb3da0b60110675b38","abstract_canon_sha256":"591d6b4c816528c6d138be9bfc052b8f463ca04f837926ed42e28e7764771a9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:12.731212Z","signature_b64":"t/s5BsUIpW+rLBvvzmu3MOfb65xKcat9VQSIYVIMlYJar4j9s4q5fH9ixFX7ik9kYayPZyxDG3gaGgj9QzSQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cfecf96fe524a42559217e1d67ede46b124d21312c60f7ce6b0b77e79d48dba","last_reissued_at":"2026-05-18T00:25:12.730651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:12.730651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Protograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Gianluigi Liva, Hannes Bartz","submitted_at":"2018-01-23T11:11:32Z","abstract_excerpt":"In this paper, ensembles of quasi-cyclic moderate-density parity-check (MDPC) codes based on protographs are introduced and analyzed in the context of a McEliece-like cryptosystem. The proposed ensembles significantly improve the error correction capability of the regular MDPC code ensembles that are currently considered for post-quantum cryptosystems without increasing the public key size. The proposed ensembles are analyzed in the asymptotic setting via density evolution, both under the sum-product algorithm and a low-complexity (error-and-erasure) message passing algorithm. The asymptotic a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07484","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":"1801.07484","created_at":"2026-05-18T00:25:12.730743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07484v1","created_at":"2026-05-18T00:25:12.730743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07484","created_at":"2026-05-18T00:25:12.730743+00:00"},{"alias_kind":"pith_short_12","alias_value":"HT7M7FX6KJFE","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HT7M7FX6KJFEEVMS","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HT7M7FX6","created_at":"2026-05-18T12:32:28.185984+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/HT7M7FX6KJFEEVMSC7Q5M7W6I2","json":"https://pith.science/pith/HT7M7FX6KJFEEVMSC7Q5M7W6I2.json","graph_json":"https://pith.science/api/pith-number/HT7M7FX6KJFEEVMSC7Q5M7W6I2/graph.json","events_json":"https://pith.science/api/pith-number/HT7M7FX6KJFEEVMSC7Q5M7W6I2/events.json","paper":"https://pith.science/paper/HT7M7FX6"},"agent_actions":{"view_html":"https://pith.science/pith/HT7M7FX6KJFEEVMSC7Q5M7W6I2","download_json":"https://pith.science/pith/HT7M7FX6KJFEEVMSC7Q5M7W6I2.json","view_paper":"https://pith.science/paper/HT7M7FX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07484&json=true","fetch_graph":"https://pith.science/api/pith-number/HT7M7FX6KJFEEVMSC7Q5M7W6I2/graph.json","fetch_events":"https://pith.science/api/pith-number/HT7M7FX6KJFEEVMSC7Q5M7W6I2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HT7M7FX6KJFEEVMSC7Q5M7W6I2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HT7M7FX6KJFEEVMSC7Q5M7W6I2/action/storage_attestation","attest_author":"https://pith.science/pith/HT7M7FX6KJFEEVMSC7Q5M7W6I2/action/author_attestation","sign_citation":"https://pith.science/pith/HT7M7FX6KJFEEVMSC7Q5M7W6I2/action/citation_signature","submit_replication":"https://pith.science/pith/HT7M7FX6KJFEEVMSC7Q5M7W6I2/action/replication_record"}},"created_at":"2026-05-18T00:25:12.730743+00:00","updated_at":"2026-05-18T00:25:12.730743+00:00"}