Optimizing windowed arithmetic for quantum attacks against RSA-2048
Windowed arithmetic is a technique for reducing the cost of quantum arithmetic circuits with space-time trade-offs using memory queries to precomputed tables. It can reduce the asymptotic cost of modular exponentiation from \mathcal{O}\left(n^{2}\right) to \mathcal{O}\left(n^{2} / \log ^{2} n\right)...
Saved in:
| Published in: | 2025 62nd ACM/IEEE Design Automation Conference (DAC) pp. 1 - 7 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
22.06.2025
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Windowed arithmetic is a technique for reducing the cost of quantum arithmetic circuits with space-time trade-offs using memory queries to precomputed tables. It can reduce the asymptotic cost of modular exponentiation from \mathcal{O}\left(n^{2}\right) to \mathcal{O}\left(n^{2} / \log ^{2} n\right) operations, resulting in the current state-of-the-art compilations of quantum attacks against modern cryptography. We introduce several optimizations to windowed arithmetic. Notably, we effect an approximate 50 \% reduction in the costs of uncomputing memory lookups in quantum factoring applications. We validate our optimizations by improving the gate count of quantum attacks against public-key cryptography by 1.5 \% to 3.4 \%, depending on the key size. We also enable a 16 \% runtime reduction at the cost of a 12 \% increase in qubit count. Our techniques can be used to reduce the complexity of not only factoring algorithms but also a wide range of quantum algorithms that rely on windowed arithmetic. |
|---|---|
| AbstractList | Windowed arithmetic is a technique for reducing the cost of quantum arithmetic circuits with space-time trade-offs using memory queries to precomputed tables. It can reduce the asymptotic cost of modular exponentiation from \mathcal{O}\left(n^{2}\right) to \mathcal{O}\left(n^{2} / \log ^{2} n\right) operations, resulting in the current state-of-the-art compilations of quantum attacks against modern cryptography. We introduce several optimizations to windowed arithmetic. Notably, we effect an approximate 50 \% reduction in the costs of uncomputing memory lookups in quantum factoring applications. We validate our optimizations by improving the gate count of quantum attacks against public-key cryptography by 1.5 \% to 3.4 \%, depending on the key size. We also enable a 16 \% runtime reduction at the cost of a 12 \% increase in qubit count. Our techniques can be used to reduce the complexity of not only factoring algorithms but also a wide range of quantum algorithms that rely on windowed arithmetic. |
| Author | Luongo, Alessandro Narasimhachar, Varun Sireesh, Adithya |
| Author_xml | – sequence: 1 givenname: Alessandro surname: Luongo fullname: Luongo, Alessandro organization: Center for Quantum Technologies (CQT),Singapore – sequence: 2 givenname: Varun surname: Narasimhachar fullname: Narasimhachar, Varun organization: Agency for Science, Technology and Research (ASTAR),Singapore – sequence: 3 givenname: Adithya surname: Sireesh fullname: Sireesh, Adithya email: asireesh@ed.ac.uk organization: University of Edinburgh,Quantum Software Lab,Edinburgh,United Kingdom |
| BookMark | eNo1j8tKAzEUQCPoQmv_QCQ_MDWPm9dyGB8VCgXtvtxJMjXoZOpMStGvt6CuDpzFgXNFzvOQIyG3nC04Z-7uvm60tOAWggl1UlwKkPqMzJ1xVkqumGRgL0mz3pfUp--Ud_SYchiOMVAcU3nrY0medsNIPw-Yy6GnWAr694niDlOeCn15rStxqlyTiw4_pjj_44xsHh82zbJarZ-em3pVITeuVIaZFo2Kqm1BGTA2Cq8ZBozaqmgZOLCeSbBcheBAm-ABtIeAzrWukzNy85tNMcbtfkw9jl_b_zX5A46YR7M |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/DAC63849.2025.11132436 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9798331503048 |
| EndPage | 7 |
| ExternalDocumentID | 11132436 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Research Foundation funderid: 10.13039/501100001321 – fundername: Centre for Quantum Technologies funderid: 10.13039/501100006757 – fundername: Innovate UK funderid: 10.13039/501100006041 |
| GroupedDBID | 6IE 6IH CBEJK RIE RIO |
| ID | FETCH-LOGICAL-a179t-707ba75e5bb457478e2c60adae685e804948c034815dd9467dc446c4da99b9f3 |
| IEDL.DBID | RIE |
| IngestDate | Wed Oct 01 07:05:15 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a179t-707ba75e5bb457478e2c60adae685e804948c034815dd9467dc446c4da99b9f3 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_11132436 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-June-22 |
| PublicationDateYYYYMMDD | 2025-06-22 |
| PublicationDate_xml | – month: 06 year: 2025 text: 2025-June-22 day: 22 |
| PublicationDecade | 2020 |
| PublicationTitle | 2025 62nd ACM/IEEE Design Automation Conference (DAC) |
| PublicationTitleAbbrev | DAC |
| PublicationYear | 2025 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 2.2953248 |
| Snippet | Windowed arithmetic is a technique for reducing the cost of quantum arithmetic circuits with space-time trade-offs using memory queries to precomputed tables.... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Arithmetic circuit optimization Costs Cryptography Design automation Logic gates modular arithmetic Optimization Public key cryptography Quantum algorithm quantum computing Qubit Runtime |
| Title | Optimizing windowed arithmetic for quantum attacks against RSA-2048 |
| URI | https://ieeexplore.ieee.org/document/11132436 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ2_TwMhFMeJbRyc1Fjj7zC40p4cP46xqTYOpjbamG4NP95ph7a25WziXy_QVuPg4EaA5MIDDr7A5z2ErpnRLC8dJbkDRZgASwwwSUzOslBEM0hH2S8PstcrhkPV38DqiYUBgPT4DJoxme7y3cxW8aislcKis1zUUE1KsYa1NtTvTaZat-1OGE0s4ieUN7eVf4VNSatGd_-f3ztAjR_-Dve_V5ZDtAPTI9R5DLN7Mv4MOXgVlPRsBQ4HpevfJhFExGH3iedVMFQ1wdr7yM5j_RqE_9Ljp-c2ib5zG2jQvRt07skmBALRYaZ4IjNptOTAjWE8uroHakWmnQZRcCiScxebRZiWO6fCT8_ZoO8sc1opo8r8GNWnsymcIBy6REpV5MLqktnSFc5YJawIck0Kw-kpakQDjN7XTi5G27af_ZF_jvaimeOrKUovUN0vKrhEu_bDj5eLq9Q1Xwx_kI0 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3LT8IwHMcbRRM9qRHj2x68FubWx3okKMGISJQYbqSP35QDQ2GTxL_etoDGgwdvS7e06a_Pb9fP74fQJdWKJpmNSWJBEsrBEA1UEJ3QyL2KIwhH2c8d0e2mg4HsLWH1wMIAQLh8BjX_GP7l24kp_VFZPYRFpwlfRxuMunwWuNaS-72KZP260XT9iXoAJWa11ee_AqeEdaO1888Sd1H1h8DDve-1ZQ-tQb6Pmg9ufI9Hny4Fz52WnszBYqd1i9exRxGx23_i99KZqhxjVRSensfqxUn_WYEfnxrEe8-ton7rpt9sk2UQBKLcWCmIiIRWggHTmjLv7B5iwyNlFfCUQRrcu5jI47TMWummPWucwjPUKim1zJIDVMknORwi7BpFCJkm3KiMmsymVhvJDXeCTXDN4iNU9QYYvi3cXAxXdT_-I_0CbbX7951h57Z7d4K2vcn9Hao4PkWVYlrCGdo0H8VoNj0PzfQFw6mT1A |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2025+62nd+ACM%2FIEEE+Design+Automation+Conference+%28DAC%29&rft.atitle=Optimizing+windowed+arithmetic+for+quantum+attacks+against+RSA-2048&rft.au=Luongo%2C+Alessandro&rft.au=Narasimhachar%2C+Varun&rft.au=Sireesh%2C+Adithya&rft.date=2025-06-22&rft.pub=IEEE&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FDAC63849.2025.11132436&rft.externalDocID=11132436 |