{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4Y7MUIDVW5BKBTOSR3K57FNXFL","short_pith_number":"pith:4Y7MUIDV","canonical_record":{"source":{"id":"1102.2566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-13T07:26:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"25838e446fab9f626cb814630959fafc94d28fa88cc54330d4dea1e2f78120ac","abstract_canon_sha256":"e708e24e498cb7be9bd7e7788d1ab1b07d9397d779c61b9e45bf4ed2716f653b"},"schema_version":"1.0"},"canonical_sha256":"e63eca2075b742a0cdd28ed5df95b72af640d3a28e8d175a8ed9440f66969827","source":{"kind":"arxiv","id":"1102.2566","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2566","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2566v2","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2566","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"4Y7MUIDVW5BK","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4Y7MUIDVW5BKBTOS","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4Y7MUIDV","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4Y7MUIDVW5BKBTOSR3K57FNXFL","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-13T07:26:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"25838e446fab9f626cb814630959fafc94d28fa88cc54330d4dea1e2f78120ac","abstract_canon_sha256":"e708e24e498cb7be9bd7e7788d1ab1b07d9397d779c61b9e45bf4ed2716f653b"},"schema_version":"1.0"},"canonical_sha256":"e63eca2075b742a0cdd28ed5df95b72af640d3a28e8d175a8ed9440f66969827","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:13.531483Z","signature_b64":"85BWGKLWNsv3Yo13l/na1T3H5zE+SO3OIxFrGNWPDI1HFV0nY/flLIwsjo+Rqk5GviNSO//IBBFeT9RoJF1UDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e63eca2075b742a0cdd28ed5df95b72af640d3a28e8d175a8ed9440f66969827","last_reissued_at":"2026-05-18T04:08:13.531061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:13.531061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2566","source_version":2,"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-18T04:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2RCcg53dcr4qMbaOc6S51e1M5RhHCSxtfzCXeCp3XkYITrXxPeIk02T375BAkXR55qVFBHiREMlBrm8sUxk8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:52:35.157333Z"},"content_sha256":"2f5fc8c33e98865cda8d3b55dcd496c480614d67f0a9f6958e274ece0a060d97","schema_version":"1.0","event_id":"sha256:2f5fc8c33e98865cda8d3b55dcd496c480614d67f0a9f6958e274ece0a060d97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4Y7MUIDVW5BKBTOSR3K57FNXFL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Key Reduction of McEliece's Cryptosystem Using List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Barreto S. L. M. Paulo (IME/USP), Morgan Barbier (INRIA Saclay - Ile de France)","submitted_at":"2011-02-13T07:26:03Z","abstract_excerpt":"Different variants of the code-based McEliece cryptosystem were pro- posed to reduce the size of the public key. All these variants use very structured codes, which open the door to new attacks exploiting the underlying structure. In this paper, we show that the dyadic variant can be designed to resist all known attacks. In light of a new study on list decoding algorithms for binary Goppa codes, we explain how to increase the security level for given public keysizes. Using the state-of-the-art list decoding algorithm instead of unique decoding, we exhibit a keysize gain of about 4% for the sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2566","kind":"arxiv","version":2},"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-18T04:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+nPVEcyyS8kxrqDSP0i0OUFsA5PQYkf46Xtw/x+jGt2GMq8DJslFgyGKjtrBCSmdlEHEJNuPtIrU8BRg5BkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:52:35.157677Z"},"content_sha256":"a280af4aefc3833c18eced639a25dfa72da08f554184ed7b753e20b939e6f80f","schema_version":"1.0","event_id":"sha256:a280af4aefc3833c18eced639a25dfa72da08f554184ed7b753e20b939e6f80f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4Y7MUIDVW5BKBTOSR3K57FNXFL/bundle.json","state_url":"https://pith.science/pith/4Y7MUIDVW5BKBTOSR3K57FNXFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4Y7MUIDVW5BKBTOSR3K57FNXFL/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-27T20:52:35Z","links":{"resolver":"https://pith.science/pith/4Y7MUIDVW5BKBTOSR3K57FNXFL","bundle":"https://pith.science/pith/4Y7MUIDVW5BKBTOSR3K57FNXFL/bundle.json","state":"https://pith.science/pith/4Y7MUIDVW5BKBTOSR3K57FNXFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4Y7MUIDVW5BKBTOSR3K57FNXFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4Y7MUIDVW5BKBTOSR3K57FNXFL","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":"e708e24e498cb7be9bd7e7788d1ab1b07d9397d779c61b9e45bf4ed2716f653b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-13T07:26:03Z","title_canon_sha256":"25838e446fab9f626cb814630959fafc94d28fa88cc54330d4dea1e2f78120ac"},"schema_version":"1.0","source":{"id":"1102.2566","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2566","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2566v2","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2566","created_at":"2026-05-18T04:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"4Y7MUIDVW5BK","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4Y7MUIDVW5BKBTOS","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4Y7MUIDV","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:a280af4aefc3833c18eced639a25dfa72da08f554184ed7b753e20b939e6f80f","target":"graph","created_at":"2026-05-18T04:08:13Z","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":"Different variants of the code-based McEliece cryptosystem were pro- posed to reduce the size of the public key. All these variants use very structured codes, which open the door to new attacks exploiting the underlying structure. In this paper, we show that the dyadic variant can be designed to resist all known attacks. In light of a new study on list decoding algorithms for binary Goppa codes, we explain how to increase the security level for given public keysizes. Using the state-of-the-art list decoding algorithm instead of unique decoding, we exhibit a keysize gain of about 4% for the sta","authors_text":"Barreto S. L. M. Paulo (IME/USP), Morgan Barbier (INRIA Saclay - Ile de France)","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-13T07:26:03Z","title":"Key Reduction of McEliece's Cryptosystem Using List Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2566","kind":"arxiv","version":2},"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:2f5fc8c33e98865cda8d3b55dcd496c480614d67f0a9f6958e274ece0a060d97","target":"record","created_at":"2026-05-18T04:08:13Z","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":"e708e24e498cb7be9bd7e7788d1ab1b07d9397d779c61b9e45bf4ed2716f653b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-02-13T07:26:03Z","title_canon_sha256":"25838e446fab9f626cb814630959fafc94d28fa88cc54330d4dea1e2f78120ac"},"schema_version":"1.0","source":{"id":"1102.2566","kind":"arxiv","version":2}},"canonical_sha256":"e63eca2075b742a0cdd28ed5df95b72af640d3a28e8d175a8ed9440f66969827","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e63eca2075b742a0cdd28ed5df95b72af640d3a28e8d175a8ed9440f66969827","first_computed_at":"2026-05-18T04:08:13.531061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:13.531061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"85BWGKLWNsv3Yo13l/na1T3H5zE+SO3OIxFrGNWPDI1HFV0nY/flLIwsjo+Rqk5GviNSO//IBBFeT9RoJF1UDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:13.531483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2566","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f5fc8c33e98865cda8d3b55dcd496c480614d67f0a9f6958e274ece0a060d97","sha256:a280af4aefc3833c18eced639a25dfa72da08f554184ed7b753e20b939e6f80f"],"state_sha256":"8ff47286202d0b948976830b51de3792e614ad933f26461591cdb7c31393fb8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GPhL+qCbbZEx4HR6JS2opWH/Q/SDH06Vmcre1+6fMmnHH/dRfyyUhzJdMMZRLo3ae+L7uc4QVKZ46fF6La6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:52:35.159577Z","bundle_sha256":"fd617bc51d941e04e9ac9eeaafc8c4ca5905716a9c01fd1ae8c6daa0d5da173c"}}