{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R7553YIFWDDHASZJW6YJFUPPO3","short_pith_number":"pith:R7553YIF","schema_version":"1.0","canonical_sha256":"8ffbdde105b0c6704b29b7b092d1ef76de2e2e6ca0aa67d4d3b4ab2f7ec58440","source":{"kind":"arxiv","id":"1511.08413","version":1},"attestation_state":"computed","paper":{"title":"Code-Based Cryptosystems Using Generalized Concatenated Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Karim Ishak, Martin Bossert, Sven M\\\"uelich, Sven Puchinger","submitted_at":"2015-11-26T15:14:56Z","abstract_excerpt":"The security of public-key cryptosystems is mostly based on number theoretic problems like factorization and the discrete logarithm. There exists an algorithm which solves these problems in polynomial time using a quantum computer. Hence, these cryptosystems will be broken as soon as quantum computers emerge. Code-based cryptography is an alternative which resists quantum computers since its security is based on an NP-complete problem, namely decoding of random linear codes. The McEliece cryptosystem is the most prominent scheme to realize code-based cryptography. Many codeclasses were propose"},"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":"1511.08413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-26T15:14:56Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"2fdfb96ed029d65a0a08e7b5539dcf9a833b41c87d32c661aa9b8b5abc21f8c6","abstract_canon_sha256":"4e8cb39a6807fea0ac184124a2b8dcf96dc9425e23b372a18a61dc9f30e6a13f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:54.129443Z","signature_b64":"Q6U+++AT9Bh4z45+3UbtJvfgBvPCzl0XPl8afwuI5nrgDc3VSUtmeiJBKJpz00bEbR9YpNdO9iuNzoOpvoWuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ffbdde105b0c6704b29b7b092d1ef76de2e2e6ca0aa67d4d3b4ab2f7ec58440","last_reissued_at":"2026-05-18T01:25:54.128737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:54.128737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code-Based Cryptosystems Using Generalized Concatenated Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Karim Ishak, Martin Bossert, Sven M\\\"uelich, Sven Puchinger","submitted_at":"2015-11-26T15:14:56Z","abstract_excerpt":"The security of public-key cryptosystems is mostly based on number theoretic problems like factorization and the discrete logarithm. There exists an algorithm which solves these problems in polynomial time using a quantum computer. Hence, these cryptosystems will be broken as soon as quantum computers emerge. Code-based cryptography is an alternative which resists quantum computers since its security is based on an NP-complete problem, namely decoding of random linear codes. The McEliece cryptosystem is the most prominent scheme to realize code-based cryptography. Many codeclasses were propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08413","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":"1511.08413","created_at":"2026-05-18T01:25:54.128844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08413v1","created_at":"2026-05-18T01:25:54.128844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08413","created_at":"2026-05-18T01:25:54.128844+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7553YIFWDDH","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7553YIFWDDHASZJ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7553YIF","created_at":"2026-05-18T12:29:39.896362+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/R7553YIFWDDHASZJW6YJFUPPO3","json":"https://pith.science/pith/R7553YIFWDDHASZJW6YJFUPPO3.json","graph_json":"https://pith.science/api/pith-number/R7553YIFWDDHASZJW6YJFUPPO3/graph.json","events_json":"https://pith.science/api/pith-number/R7553YIFWDDHASZJW6YJFUPPO3/events.json","paper":"https://pith.science/paper/R7553YIF"},"agent_actions":{"view_html":"https://pith.science/pith/R7553YIFWDDHASZJW6YJFUPPO3","download_json":"https://pith.science/pith/R7553YIFWDDHASZJW6YJFUPPO3.json","view_paper":"https://pith.science/paper/R7553YIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08413&json=true","fetch_graph":"https://pith.science/api/pith-number/R7553YIFWDDHASZJW6YJFUPPO3/graph.json","fetch_events":"https://pith.science/api/pith-number/R7553YIFWDDHASZJW6YJFUPPO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7553YIFWDDHASZJW6YJFUPPO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7553YIFWDDHASZJW6YJFUPPO3/action/storage_attestation","attest_author":"https://pith.science/pith/R7553YIFWDDHASZJW6YJFUPPO3/action/author_attestation","sign_citation":"https://pith.science/pith/R7553YIFWDDHASZJW6YJFUPPO3/action/citation_signature","submit_replication":"https://pith.science/pith/R7553YIFWDDHASZJW6YJFUPPO3/action/replication_record"}},"created_at":"2026-05-18T01:25:54.128844+00:00","updated_at":"2026-05-18T01:25:54.128844+00:00"}