{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HQ3W3KPN2F3Y62AJN56KFHYZYA","short_pith_number":"pith:HQ3W3KPN","schema_version":"1.0","canonical_sha256":"3c376da9edd1778f68096f7ca29f19c03f275eace1b6217435aa193c06e81577","source":{"kind":"arxiv","id":"1803.05289","version":1},"attestation_state":"computed","paper":{"title":"On the Security of Some Compact Keys for McEliece Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Elise Barelli","submitted_at":"2018-03-14T14:06:37Z","abstract_excerpt":"In this paper we study the security of the key of compact McEliece schemes based on alternant/Goppa codes with a non-trivial permutation group, in particular quasi-cyclic alternant codes. We show that it is possible to reduce the key-recovery problem on the original quasi-cyclic code to the same problem on a smaller code derived from the public key. This result is obtained thanks to the invariant code operation which gives the subcode whose elements are fixed by a permutation in Perm(C). The fundamental advantage is that the invariant subcode of an alternant code is an alternant code. This app"},"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":"1803.05289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-14T14:06:37Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"554cee6e259439cba160f45309168b81ca7614aa320ab05b0e752209e1891ea8","abstract_canon_sha256":"940f7429a8c8ec27443cf3c785f03707eb968e8db554a078dc37f07c37729789"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:01.702085Z","signature_b64":"Juuzht7yHCH5eUME90FAOIkrbXV+XKE0b6ylDz5rTIRl4JyU074VNN4LIf8Xfmo1ExxWuuzf5Osm3Fdhj/KuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c376da9edd1778f68096f7ca29f19c03f275eace1b6217435aa193c06e81577","last_reissued_at":"2026-05-18T00:21:01.701685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:01.701685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Security of Some Compact Keys for McEliece Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Elise Barelli","submitted_at":"2018-03-14T14:06:37Z","abstract_excerpt":"In this paper we study the security of the key of compact McEliece schemes based on alternant/Goppa codes with a non-trivial permutation group, in particular quasi-cyclic alternant codes. We show that it is possible to reduce the key-recovery problem on the original quasi-cyclic code to the same problem on a smaller code derived from the public key. This result is obtained thanks to the invariant code operation which gives the subcode whose elements are fixed by a permutation in Perm(C). The fundamental advantage is that the invariant subcode of an alternant code is an alternant code. This app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05289","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":"1803.05289","created_at":"2026-05-18T00:21:01.701757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05289v1","created_at":"2026-05-18T00:21:01.701757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05289","created_at":"2026-05-18T00:21:01.701757+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQ3W3KPN2F3Y","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQ3W3KPN2F3Y62AJ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQ3W3KPN","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/HQ3W3KPN2F3Y62AJN56KFHYZYA","json":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA.json","graph_json":"https://pith.science/api/pith-number/HQ3W3KPN2F3Y62AJN56KFHYZYA/graph.json","events_json":"https://pith.science/api/pith-number/HQ3W3KPN2F3Y62AJN56KFHYZYA/events.json","paper":"https://pith.science/paper/HQ3W3KPN"},"agent_actions":{"view_html":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA","download_json":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA.json","view_paper":"https://pith.science/paper/HQ3W3KPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05289&json=true","fetch_graph":"https://pith.science/api/pith-number/HQ3W3KPN2F3Y62AJN56KFHYZYA/graph.json","fetch_events":"https://pith.science/api/pith-number/HQ3W3KPN2F3Y62AJN56KFHYZYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/action/storage_attestation","attest_author":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/action/author_attestation","sign_citation":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/action/citation_signature","submit_replication":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/action/replication_record"}},"created_at":"2026-05-18T00:21:01.701757+00:00","updated_at":"2026-05-18T00:21:01.701757+00:00"}