{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LZ3L6LYODLT7SHSFWZMXLR6J7L","short_pith_number":"pith:LZ3L6LYO","schema_version":"1.0","canonical_sha256":"5e76bf2f0e1ae7f91e45b65975c7c9facf01b1c90915b110fc8ad06e5c28b721","source":{"kind":"arxiv","id":"1407.7598","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.7598","created_at":"2026-05-18T01:06:41.242744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7598v1","created_at":"2026-05-18T01:06:41.242744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7598","created_at":"2026-05-18T01:06:41.242744+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZ3L6LYODLT7","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZ3L6LYODLT7SHSF","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZ3L6LYO","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L","json":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L.json","graph_json":"https://pith.science/api/pith-number/LZ3L6LYODLT7SHSFWZMXLR6J7L/graph.json","events_json":"https://pith.science/api/pith-number/LZ3L6LYODLT7SHSFWZMXLR6J7L/events.json","paper":"https://pith.science/paper/LZ3L6LYO"},"agent_actions":{"view_html":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L","download_json":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L.json","view_paper":"https://pith.science/paper/LZ3L6LYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7598&json=true","fetch_graph":"https://pith.science/api/pith-number/LZ3L6LYODLT7SHSFWZMXLR6J7L/graph.json","fetch_events":"https://pith.science/api/pith-number/LZ3L6LYODLT7SHSFWZMXLR6J7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/action/storage_attestation","attest_author":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/action/author_attestation","sign_citation":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/action/citation_signature","submit_replication":"https://pith.science/pith/LZ3L6LYODLT7SHSFWZMXLR6J7L/action/replication_record"}},"created_at":"2026-05-18T01:06:41.242744+00:00","updated_at":"2026-05-18T01:06:41.242744+00:00"}