{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:OCVGKYSRR7EGMBLI2VGAQMHYB5","short_pith_number":"pith:OCVGKYSR","schema_version":"1.0","canonical_sha256":"70aa6562518fc8660568d54c0830f80f4dd81cdf90731cd1e8e760e7a3c1349d","source":{"kind":"arxiv","id":"0901.0911","version":3},"attestation_state":"computed","paper":{"title":"Fault Attacks on RSA Public Keys: Left-To-Right Implementations are also Vulnerable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Alexandre Berzati (LETI, C\\'ecile Canovas (LETI), Jean-Guillaume Dumas (LJK), Louis Goubin (PRISM), PRISM)","submitted_at":"2009-01-07T20:15:58Z","abstract_excerpt":"After attacking the RSA by injecting fault and corresponding countermeasures, works appear now about the need for protecting RSA public elements against fault attacks. We provide here an extension of a recent attack based on the public modulus corruption. The difficulty to decompose the \"Left-To-Right\" exponentiation into partial multiplications is overcome by modifying the public modulus to a number with known factorization. This fault model is justified here by a complete study of faulty prime numbers with a fixed size. The good success rate of this attack combined with its practicability ra"},"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":"0901.0911","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2009-01-07T20:15:58Z","cross_cats_sorted":[],"title_canon_sha256":"69a588b6220cf0c3689f0a469db68aea00761ae35399f665ea5e0ef5e4a9f782","abstract_canon_sha256":"c3399fa32acc24d64cc6a46be4933c1b02ba105b45890904dcb9c4e17d6f8258"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:26.711304Z","signature_b64":"/ERQ83RRVIil4TmxGwSjQxLawpBedhgEhUhmqlbw3fY4m70ul//L/lXtIiBnBEu3COn+EwNE/8T04acXed86DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70aa6562518fc8660568d54c0830f80f4dd81cdf90731cd1e8e760e7a3c1349d","last_reissued_at":"2026-05-18T04:30:26.710793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:26.710793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault Attacks on RSA Public Keys: Left-To-Right Implementations are also Vulnerable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Alexandre Berzati (LETI, C\\'ecile Canovas (LETI), Jean-Guillaume Dumas (LJK), Louis Goubin (PRISM), PRISM)","submitted_at":"2009-01-07T20:15:58Z","abstract_excerpt":"After attacking the RSA by injecting fault and corresponding countermeasures, works appear now about the need for protecting RSA public elements against fault attacks. We provide here an extension of a recent attack based on the public modulus corruption. The difficulty to decompose the \"Left-To-Right\" exponentiation into partial multiplications is overcome by modifying the public modulus to a number with known factorization. This fault model is justified here by a complete study of faulty prime numbers with a fixed size. The good success rate of this attack combined with its practicability ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0911","kind":"arxiv","version":3},"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":"0901.0911","created_at":"2026-05-18T04:30:26.710875+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.0911v3","created_at":"2026-05-18T04:30:26.710875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0911","created_at":"2026-05-18T04:30:26.710875+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCVGKYSRR7EG","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCVGKYSRR7EGMBLI","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCVGKYSR","created_at":"2026-05-18T12:26:01.383474+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/OCVGKYSRR7EGMBLI2VGAQMHYB5","json":"https://pith.science/pith/OCVGKYSRR7EGMBLI2VGAQMHYB5.json","graph_json":"https://pith.science/api/pith-number/OCVGKYSRR7EGMBLI2VGAQMHYB5/graph.json","events_json":"https://pith.science/api/pith-number/OCVGKYSRR7EGMBLI2VGAQMHYB5/events.json","paper":"https://pith.science/paper/OCVGKYSR"},"agent_actions":{"view_html":"https://pith.science/pith/OCVGKYSRR7EGMBLI2VGAQMHYB5","download_json":"https://pith.science/pith/OCVGKYSRR7EGMBLI2VGAQMHYB5.json","view_paper":"https://pith.science/paper/OCVGKYSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.0911&json=true","fetch_graph":"https://pith.science/api/pith-number/OCVGKYSRR7EGMBLI2VGAQMHYB5/graph.json","fetch_events":"https://pith.science/api/pith-number/OCVGKYSRR7EGMBLI2VGAQMHYB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCVGKYSRR7EGMBLI2VGAQMHYB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCVGKYSRR7EGMBLI2VGAQMHYB5/action/storage_attestation","attest_author":"https://pith.science/pith/OCVGKYSRR7EGMBLI2VGAQMHYB5/action/author_attestation","sign_citation":"https://pith.science/pith/OCVGKYSRR7EGMBLI2VGAQMHYB5/action/citation_signature","submit_replication":"https://pith.science/pith/OCVGKYSRR7EGMBLI2VGAQMHYB5/action/replication_record"}},"created_at":"2026-05-18T04:30:26.710875+00:00","updated_at":"2026-05-18T04:30:26.710875+00:00"}