{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WIWDFE6Y3AUQCWYUO7PT7QRETE","short_pith_number":"pith:WIWDFE6Y","canonical_record":{"source":{"id":"1902.02748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-07T17:46:22Z","cross_cats_sorted":["math.AG","math.CO","math.GR","math.RA"],"title_canon_sha256":"5a8be24a877b495de4ee03a83c3763b15d74d907a8611248a346b0faa910b4f4","abstract_canon_sha256":"fd1bf378dcd3ecd7c27a0706953bf7f588d20bb8a023edb7318848b2e68cc35a"},"schema_version":"1.0"},"canonical_sha256":"b22c3293d8d829015b1477df3fc2249921d207fdd0ff325023c17a370ac890b4","source":{"kind":"arxiv","id":"1902.02748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02748","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02748v1","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02748","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"pith_short_12","alias_value":"WIWDFE6Y3AUQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WIWDFE6Y3AUQCWYU","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WIWDFE6Y","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WIWDFE6Y3AUQCWYUO7PT7QRETE","target":"record","payload":{"canonical_record":{"source":{"id":"1902.02748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-07T17:46:22Z","cross_cats_sorted":["math.AG","math.CO","math.GR","math.RA"],"title_canon_sha256":"5a8be24a877b495de4ee03a83c3763b15d74d907a8611248a346b0faa910b4f4","abstract_canon_sha256":"fd1bf378dcd3ecd7c27a0706953bf7f588d20bb8a023edb7318848b2e68cc35a"},"schema_version":"1.0"},"canonical_sha256":"b22c3293d8d829015b1477df3fc2249921d207fdd0ff325023c17a370ac890b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:32.321602Z","signature_b64":"SFV7Z4vfm7lsq+Y6NqTBjeiNk0Xop3YV5kR60ccMOrZJZLa2Au8o4Ad7bkbvSqP2RkcVJeQH8G/QiZBzfBNJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22c3293d8d829015b1477df3fc2249921d207fdd0ff325023c17a370ac890b4","last_reissued_at":"2026-05-17T23:54:32.320952Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:32.320952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.02748","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-17T23:54:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QV1LcoWARFHrXAxyTS9//aOTM+R6tnm+Jon7vbGkj/Beegg918ZXXjszc0l2UOr3ZesKc8icYHetMlz6o+xdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:10:40.157460Z"},"content_sha256":"638a8497dd97548e60f90abf96d4f538b041c9cdcf335aa8823b6622d283818c","schema_version":"1.0","event_id":"sha256:638a8497dd97548e60f90abf96d4f538b041c9cdcf335aa8823b6622d283818c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WIWDFE6Y3AUQCWYUO7PT7QRETE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructive Non-Linear Polynomial Cryptanalysis of a Historical Block Cipher","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO","math.GR","math.RA"],"primary_cat":"cs.CR","authors_text":"Marios Georgiou, Nicolas T. Courtois","submitted_at":"2019-02-07T17:46:22Z","abstract_excerpt":"One of the major open problems in symmetric cryptanalysis is to discover new specif i c types of invariant properties which can hold for a larger number of rounds of a block cipher. We have Generalised Linear Cryptanalysis (GLC) and Partitioning Cryptanalysis (PC). Due to double-exponential combinatorial explosion of the number of possible invariant properties systematic exploration is not possible and extremely few positive working examples of GLC are known. Our answer is to work with polynomial algebraic invariants which makes partitions more intelligible. We have developed a constructive al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02748","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-17T23:54:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a0TAGyRSch3mlmJB9s9DfRZqkGgzjIf2ZkI+TkcsGuKD2PHCPoiUcDyDi3NNWdq3FLBdF6d1ToyKPMnmWih4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:10:40.157809Z"},"content_sha256":"0d2795b800fbc6024e9788c3804f857f042f97db74258879d30c70e569813e1d","schema_version":"1.0","event_id":"sha256:0d2795b800fbc6024e9788c3804f857f042f97db74258879d30c70e569813e1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIWDFE6Y3AUQCWYUO7PT7QRETE/bundle.json","state_url":"https://pith.science/pith/WIWDFE6Y3AUQCWYUO7PT7QRETE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIWDFE6Y3AUQCWYUO7PT7QRETE/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-21T22:10:40Z","links":{"resolver":"https://pith.science/pith/WIWDFE6Y3AUQCWYUO7PT7QRETE","bundle":"https://pith.science/pith/WIWDFE6Y3AUQCWYUO7PT7QRETE/bundle.json","state":"https://pith.science/pith/WIWDFE6Y3AUQCWYUO7PT7QRETE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIWDFE6Y3AUQCWYUO7PT7QRETE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WIWDFE6Y3AUQCWYUO7PT7QRETE","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":"fd1bf378dcd3ecd7c27a0706953bf7f588d20bb8a023edb7318848b2e68cc35a","cross_cats_sorted":["math.AG","math.CO","math.GR","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-07T17:46:22Z","title_canon_sha256":"5a8be24a877b495de4ee03a83c3763b15d74d907a8611248a346b0faa910b4f4"},"schema_version":"1.0","source":{"id":"1902.02748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02748","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02748v1","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02748","created_at":"2026-05-17T23:54:32Z"},{"alias_kind":"pith_short_12","alias_value":"WIWDFE6Y3AUQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WIWDFE6Y3AUQCWYU","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WIWDFE6Y","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:0d2795b800fbc6024e9788c3804f857f042f97db74258879d30c70e569813e1d","target":"graph","created_at":"2026-05-17T23:54:32Z","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":"One of the major open problems in symmetric cryptanalysis is to discover new specif i c types of invariant properties which can hold for a larger number of rounds of a block cipher. We have Generalised Linear Cryptanalysis (GLC) and Partitioning Cryptanalysis (PC). Due to double-exponential combinatorial explosion of the number of possible invariant properties systematic exploration is not possible and extremely few positive working examples of GLC are known. Our answer is to work with polynomial algebraic invariants which makes partitions more intelligible. We have developed a constructive al","authors_text":"Marios Georgiou, Nicolas T. Courtois","cross_cats":["math.AG","math.CO","math.GR","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-07T17:46:22Z","title":"Constructive Non-Linear Polynomial Cryptanalysis of a Historical Block Cipher"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02748","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:638a8497dd97548e60f90abf96d4f538b041c9cdcf335aa8823b6622d283818c","target":"record","created_at":"2026-05-17T23:54:32Z","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":"fd1bf378dcd3ecd7c27a0706953bf7f588d20bb8a023edb7318848b2e68cc35a","cross_cats_sorted":["math.AG","math.CO","math.GR","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-02-07T17:46:22Z","title_canon_sha256":"5a8be24a877b495de4ee03a83c3763b15d74d907a8611248a346b0faa910b4f4"},"schema_version":"1.0","source":{"id":"1902.02748","kind":"arxiv","version":1}},"canonical_sha256":"b22c3293d8d829015b1477df3fc2249921d207fdd0ff325023c17a370ac890b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b22c3293d8d829015b1477df3fc2249921d207fdd0ff325023c17a370ac890b4","first_computed_at":"2026-05-17T23:54:32.320952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:32.320952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SFV7Z4vfm7lsq+Y6NqTBjeiNk0Xop3YV5kR60ccMOrZJZLa2Au8o4Ad7bkbvSqP2RkcVJeQH8G/QiZBzfBNJAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:32.321602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:638a8497dd97548e60f90abf96d4f538b041c9cdcf335aa8823b6622d283818c","sha256:0d2795b800fbc6024e9788c3804f857f042f97db74258879d30c70e569813e1d"],"state_sha256":"dc7a3504ffdf3d259d177f22e6ac4f6147bcad8449f6765232d8ad3535618898"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImUZfq6eGnjUXylqoMLQl7HQryB7AymutH7YB1cE+ItQpXYaRk2Xc3Ugvha5VTm4Effsj88HO3u2pD63wwU3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:10:40.159807Z","bundle_sha256":"375546adab9f2ba1c29f6d56b891f3be9ffc6066423858b52567b30ffe66145b"}}