{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HQ3W3KPN2F3Y62AJN56KFHYZYA","short_pith_number":"pith:HQ3W3KPN","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"},"canonical_sha256":"3c376da9edd1778f68096f7ca29f19c03f275eace1b6217435aa193c06e81577","source":{"kind":"arxiv","id":"1803.05289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05289","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05289v1","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05289","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"HQ3W3KPN2F3Y","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HQ3W3KPN2F3Y62AJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HQ3W3KPN","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HQ3W3KPN2F3Y62AJN56KFHYZYA","target":"record","payload":{"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"},"canonical_sha256":"3c376da9edd1778f68096f7ca29f19c03f275eace1b6217435aa193c06e81577","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"},"source_kind":"arxiv","source_id":"1803.05289","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emyMr2xV9C6GPH862KfJybR20npFEfAAiOHMAZ5Vi7+T3pph06N70Hlzje32FoPLjXPSMVYZDpDMKn2Cs5iiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:24:00.815839Z"},"content_sha256":"509776c802e80203adf1235ed1cfa2b8132935e731ac080dc76e246e9585b79a","schema_version":"1.0","event_id":"sha256:509776c802e80203adf1235ed1cfa2b8132935e731ac080dc76e246e9585b79a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HQ3W3KPN2F3Y62AJN56KFHYZYA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wP7kxFt7MX1vnEH5fIpgwZmYohOwb0G3bzyK+aqcvvTh8CA5gkG/3LeCefnfJe0Z1UuE+8QgzxJnS6ySAvKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:24:00.816460Z"},"content_sha256":"08ce8c82ae07f83a1ffa095c5195e075c9bb48d920ca6d586ff818ff78a9cc2b","schema_version":"1.0","event_id":"sha256:08ce8c82ae07f83a1ffa095c5195e075c9bb48d920ca6d586ff818ff78a9cc2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/bundle.json","state_url":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T22:24:00Z","links":{"resolver":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA","bundle":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/bundle.json","state":"https://pith.science/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQ3W3KPN2F3Y62AJN56KFHYZYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HQ3W3KPN2F3Y62AJN56KFHYZYA","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":"940f7429a8c8ec27443cf3c785f03707eb968e8db554a078dc37f07c37729789","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-14T14:06:37Z","title_canon_sha256":"554cee6e259439cba160f45309168b81ca7614aa320ab05b0e752209e1891ea8"},"schema_version":"1.0","source":{"id":"1803.05289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05289","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05289v1","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05289","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"HQ3W3KPN2F3Y","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HQ3W3KPN2F3Y62AJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HQ3W3KPN","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:08ce8c82ae07f83a1ffa095c5195e075c9bb48d920ca6d586ff818ff78a9cc2b","target":"graph","created_at":"2026-05-18T00:21:01Z","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":"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","authors_text":"Elise Barelli","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-14T14:06:37Z","title":"On the Security of Some Compact Keys for McEliece Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05289","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:509776c802e80203adf1235ed1cfa2b8132935e731ac080dc76e246e9585b79a","target":"record","created_at":"2026-05-18T00:21:01Z","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":"940f7429a8c8ec27443cf3c785f03707eb968e8db554a078dc37f07c37729789","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-14T14:06:37Z","title_canon_sha256":"554cee6e259439cba160f45309168b81ca7614aa320ab05b0e752209e1891ea8"},"schema_version":"1.0","source":{"id":"1803.05289","kind":"arxiv","version":1}},"canonical_sha256":"3c376da9edd1778f68096f7ca29f19c03f275eace1b6217435aa193c06e81577","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c376da9edd1778f68096f7ca29f19c03f275eace1b6217435aa193c06e81577","first_computed_at":"2026-05-18T00:21:01.701685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:01.701685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Juuzht7yHCH5eUME90FAOIkrbXV+XKE0b6ylDz5rTIRl4JyU074VNN4LIf8Xfmo1ExxWuuzf5Osm3Fdhj/KuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:01.702085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:509776c802e80203adf1235ed1cfa2b8132935e731ac080dc76e246e9585b79a","sha256:08ce8c82ae07f83a1ffa095c5195e075c9bb48d920ca6d586ff818ff78a9cc2b"],"state_sha256":"0950efc3289afc3c830fddca149c6883962ba458bde5e1f0348002660f0014c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+Tc87ihMbaBu8cbsfaDKm/BF4Ah/GA90a79ibkwAN+cxr08HK2sOinLA7dzI3G6lJiQr9fhO4fCINOgXF4oBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:24:00.819549Z","bundle_sha256":"6c4bf0c8f5938c16d494a16a3430771d6946ba8e6660838758a13661caf21cdc"}}