{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LZ3L6LYODLT7SHSFWZMXLR6J7L","short_pith_number":"pith:LZ3L6LYO","canonical_record":{"source":{"id":"1407.7598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-28T23:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"b37aeb876cacb41c69a8e5cc8930b3c22a2445bcc30f9cd42c5eeb485e920783","abstract_canon_sha256":"9c38c38d3f17b06623c262d0aca82c57050e9a9c12c6074833848ba4c79ba392"},"schema_version":"1.0"},"canonical_sha256":"5e76bf2f0e1ae7f91e45b65975c7c9facf01b1c90915b110fc8ad06e5c28b721","source":{"kind":"arxiv","id":"1407.7598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7598","created_at":"2026-05-18T01:06:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7598v1","created_at":"2026-05-18T01:06:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7598","created_at":"2026-05-18T01:06:41Z"},{"alias_kind":"pith_short_12","alias_value":"LZ3L6LYODLT7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LZ3L6LYODLT7SHSF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LZ3L6LYO","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LZ3L6LYODLT7SHSFWZMXLR6J7L","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-28T23:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"b37aeb876cacb41c69a8e5cc8930b3c22a2445bcc30f9cd42c5eeb485e920783","abstract_canon_sha256":"9c38c38d3f17b06623c262d0aca82c57050e9a9c12c6074833848ba4c79ba392"},"schema_version":"1.0"},"canonical_sha256":"5e76bf2f0e1ae7f91e45b65975c7c9facf01b1c90915b110fc8ad06e5c28b721","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:41.243222Z","signature_b64":"QGQHnkjXlTIY5tjKgqkIrNlBf6In1x72NR13dxLb2yW0eCC0zCaVbDgTpjKkgFsvHbgZ3aCIu3fC7MfGosXTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e76bf2f0e1ae7f91e45b65975c7c9facf01b1c90915b110fc8ad06e5c28b721","last_reissued_at":"2026-05-18T01:06:41.242648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:41.242648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7598","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-18T01:06:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Avb8DmJdKUhEoHAQFv0+hVrSlC+BUmJBjj5Qwo9RzjpHv34ziLremWrZs5itdnnBp6IqgUxR1grQl3+bWlltCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:53:21.901925Z"},"content_sha256":"05671ff4889b09d837d4d928ebbf6a1689591cec790c943b4567ef1197af09a0","schema_version":"1.0","event_id":"sha256:05671ff4889b09d837d4d928ebbf6a1689591cec790c943b4567ef1197af09a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LZ3L6LYODLT7SHSFWZMXLR6J7L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Double Counting in $2^t$-ary RSA Precomputation Reveals the Secret Exponent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hideki Yoshikawa, Masahiro Kaminaga, Toshinori Suzuki","submitted_at":"2014-07-28T23:23:48Z","abstract_excerpt":"A new fault attack, double counting attack (DCA), on the precomputation of $2^t$-ary modular exponentiation for a classical RSA digital signature (i.e., RSA without the Chinese remainder theorem) is proposed. The $2^t$-ary method is the most popular and widely used algorithm to speed up the RSA signature process. Developers can realize the fastest signature process by choosing optimum $t$. For example, $t=6$ is optimum for a 1536-bit classical RSA implementation. The $2^t$-ary method requires precomputation to generate small exponentials of message. Conventional fault attack research has paid "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7598","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-18T01:06:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rf/ciSLernTvRelOKV4mkzaXxog98rzYTuJhiRufsVirhIXf4Y0aSuKLyI9UWsrZFCfs9nJ+7zzGAh5HhqVtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:53:21.902621Z"},"content_sha256":"ab9bd17d5a33ad62fd9972a403929041812f8437582e76dcbff0a7530bc06a88","schema_version":"1.0","event_id":"sha256:ab9bd17d5a33ad62fd9972a403929041812f8437582e76dcbff0a7530bc06a88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/bundle.json","state_url":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/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-05-30T19:53:21Z","links":{"resolver":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L","bundle":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/bundle.json","state":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LZ3L6LYODLT7SHSFWZMXLR6J7L","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":"9c38c38d3f17b06623c262d0aca82c57050e9a9c12c6074833848ba4c79ba392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-28T23:23:48Z","title_canon_sha256":"b37aeb876cacb41c69a8e5cc8930b3c22a2445bcc30f9cd42c5eeb485e920783"},"schema_version":"1.0","source":{"id":"1407.7598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7598","created_at":"2026-05-18T01:06:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7598v1","created_at":"2026-05-18T01:06:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7598","created_at":"2026-05-18T01:06:41Z"},{"alias_kind":"pith_short_12","alias_value":"LZ3L6LYODLT7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LZ3L6LYODLT7SHSF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LZ3L6LYO","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:ab9bd17d5a33ad62fd9972a403929041812f8437582e76dcbff0a7530bc06a88","target":"graph","created_at":"2026-05-18T01:06:41Z","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":"A new fault attack, double counting attack (DCA), on the precomputation of $2^t$-ary modular exponentiation for a classical RSA digital signature (i.e., RSA without the Chinese remainder theorem) is proposed. The $2^t$-ary method is the most popular and widely used algorithm to speed up the RSA signature process. Developers can realize the fastest signature process by choosing optimum $t$. For example, $t=6$ is optimum for a 1536-bit classical RSA implementation. The $2^t$-ary method requires precomputation to generate small exponentials of message. Conventional fault attack research has paid ","authors_text":"Hideki Yoshikawa, Masahiro Kaminaga, Toshinori Suzuki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-28T23:23:48Z","title":"Double Counting in $2^t$-ary RSA Precomputation Reveals the Secret Exponent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7598","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:05671ff4889b09d837d4d928ebbf6a1689591cec790c943b4567ef1197af09a0","target":"record","created_at":"2026-05-18T01:06:41Z","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":"9c38c38d3f17b06623c262d0aca82c57050e9a9c12c6074833848ba4c79ba392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-07-28T23:23:48Z","title_canon_sha256":"b37aeb876cacb41c69a8e5cc8930b3c22a2445bcc30f9cd42c5eeb485e920783"},"schema_version":"1.0","source":{"id":"1407.7598","kind":"arxiv","version":1}},"canonical_sha256":"5e76bf2f0e1ae7f91e45b65975c7c9facf01b1c90915b110fc8ad06e5c28b721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e76bf2f0e1ae7f91e45b65975c7c9facf01b1c90915b110fc8ad06e5c28b721","first_computed_at":"2026-05-18T01:06:41.242648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:41.242648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QGQHnkjXlTIY5tjKgqkIrNlBf6In1x72NR13dxLb2yW0eCC0zCaVbDgTpjKkgFsvHbgZ3aCIu3fC7MfGosXTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:41.243222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05671ff4889b09d837d4d928ebbf6a1689591cec790c943b4567ef1197af09a0","sha256:ab9bd17d5a33ad62fd9972a403929041812f8437582e76dcbff0a7530bc06a88"],"state_sha256":"0a3a95063ec73624467a732ac9566c3f0b4a6df6e3a236a2e143ed59d0f60b93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvSce0dRvYLx9rUbvQ27jFyAH+GNyHMauNxVwfUkNdKejEmfZYKs6MRIo0W30YVNBDOgeDy+OGpCwMogDEE4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:53:21.906670Z","bundle_sha256":"c45c7e6e2d783517690093570349730678ca20c42e7bf87c486da915f6373f91"}}