{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YY4KKOYDK3H562ZJ2DBMXI4XDJ","short_pith_number":"pith:YY4KKOYD","schema_version":"1.0","canonical_sha256":"c638a53b0356cfdf6b29d0c2cba3971a797c6cad218e4417c1606564ddaffcb1","source":{"kind":"arxiv","id":"2502.17325","version":1},"attestation_state":"computed","paper":{"title":"Optimized circuits for windowed modular arithmetic with applications to quantum attacks against RSA","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adithya Sireesh, Alessandro Luongo, Varun Narasimhachar","submitted_at":"2025-02-24T16:59:16Z","abstract_excerpt":"Windowed arithmetic [Gidney, 2019] is a technique for reducing the cost of quantum arithmetic circuits with space--time tradeoffs using memory queries to precomputed tables. It can reduce the asymptotic cost of modular exponentiation from $O\\left(n^3\\right)$ to $O\\left(n^3/\\log^2 n\\right)$ operations, resulting in the current state-of-the-art compilations of quantum attacks against modern cryptography. In this work we introduce four optimizations to windowed modular exponentiation. We (1) show how the cost of unlookups can be reduced by $66\\%$ asymptotically in the number of bits, (2) illustra"},"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":"2502.17325","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-24T16:59:16Z","cross_cats_sorted":[],"title_canon_sha256":"cad42dff8f70b58f12fdcacde0772a55aa5764c091629288734e7b27d371eb06","abstract_canon_sha256":"543dda57fde9cccdd5bbda77b62bee3eb62477fb0d0e784cab8a26f89a99a256"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:08.778900Z","signature_b64":"NkZuWpR0gAyx0s/hrg3Jyyym7lofsJFB66LQAoJjvRaxeqYj0VUya69+H0PmxAi6Y5ooTB0vhFP50YriIkcIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c638a53b0356cfdf6b29d0c2cba3971a797c6cad218e4417c1606564ddaffcb1","last_reissued_at":"2026-07-05T10:19:08.778443Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:08.778443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimized circuits for windowed modular arithmetic with applications to quantum attacks against RSA","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adithya Sireesh, Alessandro Luongo, Varun Narasimhachar","submitted_at":"2025-02-24T16:59:16Z","abstract_excerpt":"Windowed arithmetic [Gidney, 2019] is a technique for reducing the cost of quantum arithmetic circuits with space--time tradeoffs using memory queries to precomputed tables. It can reduce the asymptotic cost of modular exponentiation from $O\\left(n^3\\right)$ to $O\\left(n^3/\\log^2 n\\right)$ operations, resulting in the current state-of-the-art compilations of quantum attacks against modern cryptography. In this work we introduce four optimizations to windowed modular exponentiation. We (1) show how the cost of unlookups can be reduced by $66\\%$ asymptotically in the number of bits, (2) illustra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.17325","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.17325/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.17325","created_at":"2026-07-05T10:19:08.778493+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.17325v1","created_at":"2026-07-05T10:19:08.778493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17325","created_at":"2026-07-05T10:19:08.778493+00:00"},{"alias_kind":"pith_short_12","alias_value":"YY4KKOYDK3H5","created_at":"2026-07-05T10:19:08.778493+00:00"},{"alias_kind":"pith_short_16","alias_value":"YY4KKOYDK3H562ZJ","created_at":"2026-07-05T10:19:08.778493+00:00"},{"alias_kind":"pith_short_8","alias_value":"YY4KKOYD","created_at":"2026-07-05T10:19:08.778493+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03951","citing_title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","ref_index":99,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YY4KKOYDK3H562ZJ2DBMXI4XDJ","json":"https://pith.science/pith/YY4KKOYDK3H562ZJ2DBMXI4XDJ.json","graph_json":"https://pith.science/api/pith-number/YY4KKOYDK3H562ZJ2DBMXI4XDJ/graph.json","events_json":"https://pith.science/api/pith-number/YY4KKOYDK3H562ZJ2DBMXI4XDJ/events.json","paper":"https://pith.science/paper/YY4KKOYD"},"agent_actions":{"view_html":"https://pith.science/pith/YY4KKOYDK3H562ZJ2DBMXI4XDJ","download_json":"https://pith.science/pith/YY4KKOYDK3H562ZJ2DBMXI4XDJ.json","view_paper":"https://pith.science/paper/YY4KKOYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.17325&json=true","fetch_graph":"https://pith.science/api/pith-number/YY4KKOYDK3H562ZJ2DBMXI4XDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YY4KKOYDK3H562ZJ2DBMXI4XDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YY4KKOYDK3H562ZJ2DBMXI4XDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YY4KKOYDK3H562ZJ2DBMXI4XDJ/action/storage_attestation","attest_author":"https://pith.science/pith/YY4KKOYDK3H562ZJ2DBMXI4XDJ/action/author_attestation","sign_citation":"https://pith.science/pith/YY4KKOYDK3H562ZJ2DBMXI4XDJ/action/citation_signature","submit_replication":"https://pith.science/pith/YY4KKOYDK3H562ZJ2DBMXI4XDJ/action/replication_record"}},"created_at":"2026-07-05T10:19:08.778493+00:00","updated_at":"2026-07-05T10:19:08.778493+00:00"}