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)...
Uloženo v:
| Vydáno v: | 2025 62nd ACM/IEEE Design Automation Conference (DAC) s. 1 - 7 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
22.06.2025
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| 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.2956295 |
| 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/eLvHCXMwlZ1LTwIxEMcbIR48qRHjOz14LSz76ONIUOIJiXLgRvqYVQ4LCl1J_PROC2g8ePCyaZomTWfbTv-7_c0QcqtS9BracCZKfORad5kynDPpTKJ0KSTwTbIJMRzKyUSNtrB6ZGEAIF4-g3Yoxn_5bmHr8KmsE9Oi5xlvkIYQYgNrbanfbqI6d70-zqY84Cdp0d41_pU2JXqNweE_-zsirR_-jo6-Pcsx2YP5Cek_4uquZp9YQ9eopBdrcBSVrn-tAohI8fRJ32s0VF1R7X1g56l-QeG_8vTpucdC7NwWGQ_ux_0Htk2BwDSuFM9EIowWBRTG5EUIdQ-p5Yl2GrgsQMbgLjYJMG3hnMJNz1nUdzZ3WimjyuyUNOeLOZwRmmmZWCUzZ7FFJkqF4hSlQsmlsNy5_Jy0ggGmb5sgF9Pd2C_-qL8kB8HM4dZUml6Rpl_WcE327YefrZY38dV8AWBOj-s |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PT8IwFMcbRRM9qRHjb3vwOhhb1x9HghKMiEQ5cCP9NeUAU-gk8a_3tYDGgwcvS9M0afrW9vW79fMeQtciAa8hFY1YDg8iZSMSitKIGxULmTNu6TLZBOv1-HAo-itYPbAw1tpw-czWfDH8yzeFLv2nsnpIi05Suom2MkKSxhLXWnG_jVjUb5otmE_EAyhJVls3_5U4JfiN9t4_e9xH1R8CD_e_fcsB2rDTQ9R6hPU9GX9CDV6Ali4W1mDQuu514lFEDOdP_F6CqcoJls55eh7LF5D-c4efnpuRj55bRYP27aDViVZJECIJa8VFLGZKssxmSpHMB7u3iaaxNNJSnlkewrvo2OO0mTECtj2jQeFpYqQQSuTpEapMi6k9RjiVPNaCp0ZDi5TlAuQpiIWccqapMeQEVb0BRm_LMBej9dhP_6i_QjudwUN31L3r3Z-hXW9yf4cqSc5Rxc1Ke4G29Ycbz2eX4TV9AQ9xkzI |
| 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 |