{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3JOGZBL4D5J34EX7EQU5CVYMBU","short_pith_number":"pith:3JOGZBL4","canonical_record":{"source":{"id":"1904.12215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T21:46:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"490ec9e638a1b6b85a7019c591e15758b26bffe2c78d3a8eeda267baafd74ed5","abstract_canon_sha256":"9b193da10b350a7a8312b761de13bcaceb5b96dfae142c0cf86909e4aed1909a"},"schema_version":"1.0"},"canonical_sha256":"da5c6c857c1f53be12ff2429d1570c0d0bf82a393633cdbb27ea7af4f85cbb17","source":{"kind":"arxiv","id":"1904.12215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12215","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12215v1","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12215","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"3JOGZBL4D5J3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3JOGZBL4D5J34EX7","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3JOGZBL4","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3JOGZBL4D5J34EX7EQU5CVYMBU","target":"record","payload":{"canonical_record":{"source":{"id":"1904.12215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T21:46:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"490ec9e638a1b6b85a7019c591e15758b26bffe2c78d3a8eeda267baafd74ed5","abstract_canon_sha256":"9b193da10b350a7a8312b761de13bcaceb5b96dfae142c0cf86909e4aed1909a"},"schema_version":"1.0"},"canonical_sha256":"da5c6c857c1f53be12ff2429d1570c0d0bf82a393633cdbb27ea7af4f85cbb17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:38.647065Z","signature_b64":"d7/YdKzEdyUgVen8LbJZK5uCuU0snLWA2pbhKWfYY9qFNMYyvc9Os6v1aHD0guYsm4tfnVMI+KiYzG5kZB3bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da5c6c857c1f53be12ff2429d1570c0d0bf82a393633cdbb27ea7af4f85cbb17","last_reissued_at":"2026-05-17T23:47:38.646566Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:38.646566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.12215","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:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKzYNSU/cHRvvbPUZakSRe8UMorDRim7qpMUCtVtRvFdMfCX6guR978zG08tmLvhtWN+33EM+NUERuAqkRNGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:36:46.977428Z"},"content_sha256":"6732a3899243f93557eaed2a7866275cb6194ff1404719ed6f3ed7a2659e8fa5","schema_version":"1.0","event_id":"sha256:6732a3899243f93557eaed2a7866275cb6194ff1404719ed6f3ed7a2659e8fa5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3JOGZBL4D5J34EX7EQU5CVYMBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Franco Chiaraluce, Marco Baldi, Massimo Battaglioni, Paolo Santini","submitted_at":"2019-04-27T21:46:39Z","abstract_excerpt":"In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-density parity-check (MDPC) codes. We show that the feasibility of these attacks is not strictly associated to the quasi-cyclic (QC) structure of the code but is related to the intrinsically probabilistic decoding of any sparse parity-check code. So, these attacks not only work against QC codes, but can be generalized to broader classes of codes. We provide a novel algorithm that, in the case of a QC code, allows recover"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12215","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:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzVDrSJFHoIgWA6CZJFasiFsirpBQwp7Lm+NYqdghEyvGHK5BhTlShgKSFwFpiXmiYEmZKwWM3HxAA50VRuRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:36:46.977778Z"},"content_sha256":"bb0ab50102f5be2fba581c080a2b3749f9c3e2192b42357f4b3239d5dba00647","schema_version":"1.0","event_id":"sha256:bb0ab50102f5be2fba581c080a2b3749f9c3e2192b42357f4b3239d5dba00647"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JOGZBL4D5J34EX7EQU5CVYMBU/bundle.json","state_url":"https://pith.science/pith/3JOGZBL4D5J34EX7EQU5CVYMBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JOGZBL4D5J34EX7EQU5CVYMBU/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-01T22:36:46Z","links":{"resolver":"https://pith.science/pith/3JOGZBL4D5J34EX7EQU5CVYMBU","bundle":"https://pith.science/pith/3JOGZBL4D5J34EX7EQU5CVYMBU/bundle.json","state":"https://pith.science/pith/3JOGZBL4D5J34EX7EQU5CVYMBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JOGZBL4D5J34EX7EQU5CVYMBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3JOGZBL4D5J34EX7EQU5CVYMBU","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":"9b193da10b350a7a8312b761de13bcaceb5b96dfae142c0cf86909e4aed1909a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T21:46:39Z","title_canon_sha256":"490ec9e638a1b6b85a7019c591e15758b26bffe2c78d3a8eeda267baafd74ed5"},"schema_version":"1.0","source":{"id":"1904.12215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12215","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12215v1","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12215","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"3JOGZBL4D5J3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3JOGZBL4D5J34EX7","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3JOGZBL4","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:bb0ab50102f5be2fba581c080a2b3749f9c3e2192b42357f4b3239d5dba00647","target":"graph","created_at":"2026-05-17T23:47:38Z","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 reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-density parity-check (MDPC) codes. We show that the feasibility of these attacks is not strictly associated to the quasi-cyclic (QC) structure of the code but is related to the intrinsically probabilistic decoding of any sparse parity-check code. So, these attacks not only work against QC codes, but can be generalized to broader classes of codes. We provide a novel algorithm that, in the case of a QC code, allows recover","authors_text":"Franco Chiaraluce, Marco Baldi, Massimo Battaglioni, Paolo Santini","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T21:46:39Z","title":"Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12215","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:6732a3899243f93557eaed2a7866275cb6194ff1404719ed6f3ed7a2659e8fa5","target":"record","created_at":"2026-05-17T23:47:38Z","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":"9b193da10b350a7a8312b761de13bcaceb5b96dfae142c0cf86909e4aed1909a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T21:46:39Z","title_canon_sha256":"490ec9e638a1b6b85a7019c591e15758b26bffe2c78d3a8eeda267baafd74ed5"},"schema_version":"1.0","source":{"id":"1904.12215","kind":"arxiv","version":1}},"canonical_sha256":"da5c6c857c1f53be12ff2429d1570c0d0bf82a393633cdbb27ea7af4f85cbb17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da5c6c857c1f53be12ff2429d1570c0d0bf82a393633cdbb27ea7af4f85cbb17","first_computed_at":"2026-05-17T23:47:38.646566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:38.646566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d7/YdKzEdyUgVen8LbJZK5uCuU0snLWA2pbhKWfYY9qFNMYyvc9Os6v1aHD0guYsm4tfnVMI+KiYzG5kZB3bCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:38.647065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6732a3899243f93557eaed2a7866275cb6194ff1404719ed6f3ed7a2659e8fa5","sha256:bb0ab50102f5be2fba581c080a2b3749f9c3e2192b42357f4b3239d5dba00647"],"state_sha256":"1b688ec5bb736cc80d8eae75604ce0edb8e0d26bd2719c3a99680e0fcec22cd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nKAMipVIfJcI2r9pTL/nleXt5Kc41MYpkXnrUyL9ApHbTFYSNNsFHL2qsEJBvGTmATv/N9fXyVnL1a9GyH6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:36:46.980009Z","bundle_sha256":"515a93ca458b66b611b7fa9e55b0e0293d2baf62dbeeaeba1f1e50731d02c1b5"}}