{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4CBAY7LKFTSMX4QK36BPXMR6R4","short_pith_number":"pith:4CBAY7LK","schema_version":"1.0","canonical_sha256":"e0820c7d6a2ce4cbf20adf82fbb23e8f180d23e3724aab66fd5fce2255676e20","source":{"kind":"arxiv","id":"1801.05659","version":1},"attestation_state":"computed","paper":{"title":"On Decoding Schemes for the MDPC-McEliece Cryptosystem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Gianluigi Liva, Hannes Bartz","submitted_at":"2018-01-17T13:48:05Z","abstract_excerpt":"Recently, it has been shown how McEliece public-key cryptosystems based on moderate-density parity-check (MDPC) codes allow for very compact keys compared to variants based on other code families. In this paper, classical (iterative) decoding schemes for MPDC codes are considered. The algorithms are analyzed with respect to their error-correction capability as well as their resilience against a recently proposed reaction-based key-recovery attack on a variant of the MDPC-McEliece cryptosystem by Guo, Johansson and Stankovski (GJS). New message-passing decoding algorithms are presented and anal"},"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.05659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-01-17T13:48:05Z","cross_cats_sorted":[],"title_canon_sha256":"df1009b07bf04999bda444a8974170d2e7edf9c3d03b6d3983254ea5b61e6bf9","abstract_canon_sha256":"9f429fe05d29477629a2b966b6ee1bd2b8fe6032c14847f7410141617df10e16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:40.526923Z","signature_b64":"Gc2TpyEGtY8j8i12mm7maWhY8TscQ/aeD2Kpmk09cWc8gLM3LlKdGWgxyBpwQbh0AAxdtBuXoNerDzl+7F3HBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0820c7d6a2ce4cbf20adf82fbb23e8f180d23e3724aab66fd5fce2255676e20","last_reissued_at":"2026-05-18T00:25:40.526395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:40.526395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Decoding Schemes for the MDPC-McEliece Cryptosystem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Gianluigi Liva, Hannes Bartz","submitted_at":"2018-01-17T13:48:05Z","abstract_excerpt":"Recently, it has been shown how McEliece public-key cryptosystems based on moderate-density parity-check (MDPC) codes allow for very compact keys compared to variants based on other code families. In this paper, classical (iterative) decoding schemes for MPDC codes are considered. The algorithms are analyzed with respect to their error-correction capability as well as their resilience against a recently proposed reaction-based key-recovery attack on a variant of the MDPC-McEliece cryptosystem by Guo, Johansson and Stankovski (GJS). New message-passing decoding algorithms are presented and anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05659","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.05659","created_at":"2026-05-18T00:25:40.526483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05659v1","created_at":"2026-05-18T00:25:40.526483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05659","created_at":"2026-05-18T00:25:40.526483+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CBAY7LKFTSM","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CBAY7LKFTSMX4QK","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CBAY7LK","created_at":"2026-05-18T12:32:05.422762+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/4CBAY7LKFTSMX4QK36BPXMR6R4","json":"https://pith.science/pith/4CBAY7LKFTSMX4QK36BPXMR6R4.json","graph_json":"https://pith.science/api/pith-number/4CBAY7LKFTSMX4QK36BPXMR6R4/graph.json","events_json":"https://pith.science/api/pith-number/4CBAY7LKFTSMX4QK36BPXMR6R4/events.json","paper":"https://pith.science/paper/4CBAY7LK"},"agent_actions":{"view_html":"https://pith.science/pith/4CBAY7LKFTSMX4QK36BPXMR6R4","download_json":"https://pith.science/pith/4CBAY7LKFTSMX4QK36BPXMR6R4.json","view_paper":"https://pith.science/paper/4CBAY7LK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05659&json=true","fetch_graph":"https://pith.science/api/pith-number/4CBAY7LKFTSMX4QK36BPXMR6R4/graph.json","fetch_events":"https://pith.science/api/pith-number/4CBAY7LKFTSMX4QK36BPXMR6R4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CBAY7LKFTSMX4QK36BPXMR6R4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CBAY7LKFTSMX4QK36BPXMR6R4/action/storage_attestation","attest_author":"https://pith.science/pith/4CBAY7LKFTSMX4QK36BPXMR6R4/action/author_attestation","sign_citation":"https://pith.science/pith/4CBAY7LKFTSMX4QK36BPXMR6R4/action/citation_signature","submit_replication":"https://pith.science/pith/4CBAY7LKFTSMX4QK36BPXMR6R4/action/replication_record"}},"created_at":"2026-05-18T00:25:40.526483+00:00","updated_at":"2026-05-18T00:25:40.526483+00:00"}