{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:08:10Z","timestamp":1749874090794,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":71,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819655656","type":"print"},{"value":"9789819655663","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-5566-3_11","type":"book-chapter","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T20:23:17Z","timestamp":1749846197000},"page":"209-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["RSA Quantum Cryptanalysis: A Thorough Exploration of\u00a0n\u2013Bit Attacks and\u00a0Emerging Factoring Techniques"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0565-6458","authenticated-orcid":false,"given":"Rini Wisnu","family":"Wardhani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1246-7877","authenticated-orcid":false,"given":"Dedy Septono Catur","family":"Putranto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8475-7294","authenticated-orcid":false,"given":"Howon","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aboud, S.J., AL-Fayoumi, M.A., Al-Fayoumi, M., Jabbar, H.S.: An efficient RSA public key encryption scheme. In: Fifth International Conference on Information Technology: New Generations (ITNG 2008), pp. 127\u2013130. IEEE (2008)","DOI":"10.1109\/ITNG.2008.199"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Balasubramanian, K.: Variants of RSA and their cryptanalysis. In: 2014 International Conference on Communication and Network Technologies, pp. 145\u2013149. IEEE (2014)","DOI":"10.1109\/CNT.2014.7062742"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Banegas, G., Bernstein, D.J., van Hoof, I., Lange, T.: Concrete quantum cryptanalysis of binary elliptic curves. IACR Trans. Cryptogr. Hardw. Embedd. Syst. 451\u2013472 (2021)","DOI":"10.46586\/tches.v2021.i1.451-472"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Beauregard, S.: Circuit for Shor\u2019s algorithm using 2n+ 3 qubits. arXiv preprint quant-ph\/0205095 (2002)","DOI":"10.26421\/QIC3.2-8"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1103\/PhysRevA.54.1034","volume":"54","author":"D Beckman","year":"1996","unstructured":"Beckman, D., Chari, A.N., Devabhaktuni, S., Preskill, J.: Efficient networks for quantum factoring. Phys. Rev. A 54(2), 1034 (1996)","journal-title":"Phys. Rev. A"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., May, A.: Low secret exponent RSA revisited. In: Cryptography and Lattices: International Conference, CaLC 2001 Providence, RI, USA, 29\u201330 March 2001 Revised Papers, pp. 4\u201319. Springer (2001)","DOI":"10.1007\/3-540-44670-2_2"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D Boneh","year":"2000","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than n\/sup 0.292. IEEE Trans. Inf. Theory 46(4), 1339\u20131349 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thom\u00e9, E., Zimmermann, P.: Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. In: Advances in Cryptology\u2013Crypto 2020: 40th Annual International Cryptology Conference, Crypto 2020, Santa Barbara, CA, USA, 17\u201321 August 2020, Proceedings, Part II 40, pp. 62\u201391. Springer (2020)","DOI":"10.1007\/978-3-030-56880-1_3"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"022316","DOI":"10.1103\/PhysRevA.71.022316","volume":"71","author":"S Bravyi","year":"2005","unstructured":"Bravyi, S., Kitaev, A.: Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71(2), 022316 (2005)","journal-title":"Phys. Rev. A"},{"key":"11_CR10","unstructured":"Cao, Z., Cao, Z.: On Shor\u2019s factoring algorithm with more registers and the problem to certify quantum computers. arXiv preprint arXiv:1409.7352 (2014)"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.ffa.2006.05.004","volume":"13","author":"G Castagnos","year":"2007","unstructured":"Castagnos, G.: An efficient probabilistic public-key cryptosystem over quadratic fields quotients. Finite Fields Appl. 13(3), 563\u2013576 (2007)","journal-title":"Finite Fields Appl."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Cherkaoui-Semmouni, M., Nitaj, A., Susilo, W., Tonien, J.: Cryptanalysis of RSA variants with primes sharing most significant bits. In: Information Security: 24th International Conference, ISC 2021, Virtual Event, 10\u201312 November 2021, Proceedings 24, pp. 42\u201353. Springer (2021)","DOI":"10.1007\/978-3-030-91356-4_3"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Cleve, R., Watrous, J.: Fast parallel circuits for the quantum Fourier transform. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 526\u2013536. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892140"},{"issue":"6","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1109\/JSTQE.2003.820922","volume":"9","author":"D Copsey","year":"2003","unstructured":"Copsey, D., et al.: Toward a scalable, silicon-based quantum computing architecture. IEEE J. Sel. Top. Quantum Electron. 9(6), 1552\u20131569 (2003)","journal-title":"IEEE J. Sel. Top. Quantum Electron."},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s002000100088","volume":"13","author":"B De Weger","year":"2002","unstructured":"De Weger, B.: Cryptanalysis of RSA with small prime difference. Appl. Algebra Eng. Commun. Comput. 13(1), 17\u201328 (2002)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"11_CR16","unstructured":"Draper, T.G., Kutin, S.A., Rains, E.M., Svore, K.M.: A logarithmic-depth quantum carry-lookahead adder. arXiv preprint quant-ph\/0406142 (2004)"},{"key":"11_CR17","unstructured":"Eker\u00e5, M.: Modifying Shor\u2019s algorithm to compute short discrete logarithms. Cryptology ePrint Archive (2016)"},{"key":"11_CR18","unstructured":"Eker\u00e5, M.: Revisiting Shor\u2019s quantum algorithm for computing general discrete logarithms. arXiv preprint arXiv:1905.09084 (2019)"},{"issue":"11","key":"11_CR19","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1007\/s10623-020-00783-2","volume":"88","author":"M Eker\u00e5","year":"2020","unstructured":"Eker\u00e5, M.: On post-processing in the quantum algorithm for computing short discrete logarithms. Des. Codes Crypt. 88(11), 2313\u20132335 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00783-2","journal-title":"Des. Codes Crypt."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Eker\u00e5, M., H\u00e5stad, J.: Quantum algorithms for computing short discrete logarithms and factoring RSA integers. In: Post-Quantum Cryptography: 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, 26\u201328 June 2017, Proceedings 8, pp. 347\u2013363. Springer","DOI":"10.1007\/978-3-319-59879-6_20"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Elkamchouchi, H., Elshenawy, K., Shaban, H.: Extended RSA cryptosystem and digital signature schemes in the domain of gaussian integers. In: The 8th International Conference on Communication Systems, ICCS 2002, vol.\u00a01, pp. 91\u201395. IEEE (2002)","DOI":"10.1109\/ICCS.2002.1182444"},{"key":"11_CR22","unstructured":"Fowler, A.G.: Time-optimal quantum computation. arXiv preprint arXiv:1210.4626 (2012)"},{"issue":"3","key":"11_CR23","doi-asserted-by":"publisher","first-page":"032324","DOI":"10.1103\/PhysRevA.86.032324","volume":"86","author":"AG Fowler","year":"2012","unstructured":"Fowler, A.G., Mariantoni, M., Martinis, J.M., Cleland, A.N.: Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86(3), 032324 (2012)","journal-title":"Phys. Rev. A"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Genkin, D., Shamir, A., Tromer, E.: RSA key extraction via low-bandwidth acoustic cryptanalysis. In: Advances in Cryptology\u2013Crypto 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, 17\u201321 August 2014, Proceedings, Part I 34, pp. 444\u2013461. Springer (2014)","DOI":"10.1007\/978-3-662-44371-2_25"},{"key":"11_CR25","unstructured":"Gheorghiu, V., Mosca, M.: Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes. arXiv preprint arXiv:1902.02332 (2019)"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.22331\/q-2024-04-08-1310","volume":"8","author":"C Gidney","year":"2024","unstructured":"Gidney, C.: Inplace access to the surface code y basis. Quantum 8, 1310 (2024)","journal-title":"Quantum"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"433","DOI":"10.22331\/q-2021-04-15-433","volume":"5","author":"C Gidney","year":"2021","unstructured":"Gidney, C., Eker\u00e5, M.: How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, 433 (2021)","journal-title":"Quantum"},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"135","DOI":"10.22331\/q-2019-04-30-135","volume":"3","author":"C Gidney","year":"2019","unstructured":"Gidney, C., Fowler, A.G.: Efficient magic state factories with a catalyzed $$\\vert $$ccz$$\\rangle $$ to 2 $$\\vert $$t$$\\rangle $$ to transformation. Quantum 3, 135 (2019)","journal-title":"Quantum"},{"key":"11_CR29","unstructured":"Gidney, C., Fowler, A.G.: Flexible layout of surface code computations using autoCCZ states. arXiv preprint arXiv:1905.08916 (2019)"},{"issue":"14","key":"11_CR30","doi-asserted-by":"publisher","first-page":"140503","DOI":"10.1103\/PhysRevLett.127.140503","volume":"127","author":"\u00c9 Gouzien","year":"2021","unstructured":"Gouzien, \u00c9., Sangouard, N.: Factoring 2048-bit RSA integers in 177 days with 13 436 qubits and a multimode memory. Phys. Rev. Lett. 127(14), 140503 (2021)","journal-title":"Phys. Rev. Lett."},{"issue":"17","key":"11_CR31","doi-asserted-by":"publisher","first-page":"3228","DOI":"10.1103\/PhysRevLett.76.3228","volume":"76","author":"RB Griffiths","year":"1996","unstructured":"Griffiths, R.B., Niu, C.S.: Semiclassical Fourier transform for quantum computation. Phys. Rev. Lett. 76(17), 3228 (1996)","journal-title":"Phys. Rev. Lett."},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"71","DOI":"10.22331\/q-2018-06-07-71","volume":"2","author":"J Haah","year":"2018","unstructured":"Haah, J., Hastings, M.B.: Codes and protocols for distilling $$ t $$, controlled-$$ s $$, and toffoli gates. Quantum 2, 71 (2018)","journal-title":"Quantum"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"H\u00e4ner, T., Roetteler, M., Svore, K.M.: Factoring using 2n+ 2 qubits with toffoli based modular multiplication. arXiv preprint arXiv:1611.07995 (2016)","DOI":"10.26421\/QIC17.7-8-7"},{"issue":"3","key":"11_CR34","first-page":"031007","volume":"2","author":"NC Jones","year":"2012","unstructured":"Jones, N.C., et al.: Layered architecture for quantum computing. Phys. Rev. X 2(3), 031007 (2012)","journal-title":"Phys. Rev. X"},{"key":"11_CR35","unstructured":"Karatsuba, A.A., Ofman, Y.P.: Multiplication of many-digital numbers by automatic computers. In: Doklady Akademii Nauk, vol.\u00a0145, pp. 293\u2013294. Russian Academy of Sciences (1962)"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Kleinjung, T., et al.: Factorization of a 768-Bit RSA modulus. In: CRYPTO, vol. 6223, pp. 333\u2013350. Springer (2010)","DOI":"10.1007\/978-3-642-14623-7_18"},{"issue":"1","key":"11_CR37","first-page":"27","volume":"78","author":"H Kuwakado","year":"1995","unstructured":"Kuwakado, H., Koyama, K., Tsuruoka, Y.: A new RSA-type scheme based on singular cubic curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 78(1), 27\u201333 (1995)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Larasati, H.T., Kim, H.: Simulation of modular exponentiation circuit for Shor\u2019s algorithm in Qiskit. In: 2020 14th International Conference on Telecommunication Systems, Services, and Applications (TSSA), pp.\u00a01\u20137. IEEE (2020)","DOI":"10.1109\/TSSA51342.2020.9310794"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Larasati, H.T., Kim, H.: Quantum cryptanalysis landscape of Shor\u2019s algorithm for elliptic curve discrete logarithm problem. In: Information Security Applications: 22nd International Conference, WISA 2021, Jeju Island, South Korea, 11\u201313 August 2021, Revised Selected Papers 22, pp. 91\u2013104. Springer (2021)","DOI":"10.1007\/978-3-030-89432-0_8"},{"key":"11_CR40","doi-asserted-by":"publisher","first-page":"54910","DOI":"10.1109\/ACCESS.2023.3280632","volume":"11","author":"HT Larasati","year":"2023","unstructured":"Larasati, H.T., Putranto, D., Wardhani, R.W., Park, J., Kim, H.: Depth optimization of FLT-based quantum inversion circuit. IEEE Access 11, 54910\u201354927 (2023)","journal-title":"IEEE Access"},{"key":"11_CR41","doi-asserted-by":"publisher","first-page":"205","DOI":"10.22331\/q-2019-12-02-205","volume":"3","author":"D Litinski","year":"2019","unstructured":"Litinski, D.: Magic state distillation: not as costly as you think. Quantum 3, 205 (2019)","journal-title":"Quantum"},{"issue":"7","key":"11_CR42","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.ic.2006.04.003","volume":"204","author":"L Liu","year":"2006","unstructured":"Liu, L., Cao, Z.: On computing ordN (2) and its application. Inf. Comput. 204(7), 1173\u20131178 (2006)","journal-title":"Inf. Comput."},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Murru, N., Saettone, F.M.: A novel RSA-like cryptosystem based on a generalization of the r\u00e9dei rational functions. In: Number-Theoretic Methods in Cryptology: First International Conference, NuTMiC 2017, Warsaw, Poland, 11\u201313 September 2017, Revised Selected Papers 1, pp. 91\u2013103. Springer (2018)","DOI":"10.1007\/978-3-319-76620-1_6"},{"issue":"12","key":"11_CR44","doi-asserted-by":"publisher","first-page":"4791","DOI":"10.1109\/TCAD.2023.3279300","volume":"42","author":"J Nie","year":"2023","unstructured":"Nie, J., Zhu, Q., Li, M., Sun, X.: Quantum circuit design for integer multiplication based on Sch\u00f6nhage-Strassen algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(12), 4791\u20134802 (2023)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"11_CR45","unstructured":"Parent, A., Roetteler, M., Mosca, M.: Improved reversible and quantum circuits for Karatsuba-based integer multiplication. arXiv preprint arXiv:1706.03419 (2017)"},{"key":"11_CR46","unstructured":"Pavlidis, A., Gizopoulos, D.: Fast quantum modular exponentiation architecture for Shor\u2019s factorization algorithm. arXiv preprint arXiv:1207.0511 (2012)"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Peng, L., Hu, L., Lu, Y., Wei, H.: An improved analysis on three variants of the RSA cryptosystem. In: Information Security and Cryptology: 12th International Conference, Inscrypt 2016, Beijing, China, 4\u20136 November 2016, Revised Selected Papers, pp. 140\u2013149. Springer (2017)","DOI":"10.1007\/978-3-319-54705-3_9"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Putranto, D.S.C., Wardhani, R.W., Cho, J., Kim, H.: ECPM cryptanalysis resource estimation. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-981-96-1624-4_1"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Putranto, D.S.C., Wardhani, R.W., Larasati, H.T., Ji, J., Kim, H.: Depth-optimization of quantum cryptanalysis on binary elliptic curves. IEEE Access (2023)","DOI":"10.1109\/ACCESS.2023.3273601"},{"key":"11_CR50","doi-asserted-by":"publisher","first-page":"21848","DOI":"10.1109\/ACCESS.2023.3252504","volume":"11","author":"D Putranto","year":"2023","unstructured":"Putranto, D., Wardhani, R.W., Larasati, H.T., Kim, H.: Space and time-efficient quantum multiplier in post quantum cryptography era. IEEE Access 11, 21848\u201321862 (2023)","journal-title":"IEEE Access"},{"issue":"1","key":"11_CR51","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"RL Rivest","year":"1983","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 26(1), 96\u201399 (1983)","journal-title":"Commun. ACM"},{"key":"11_CR52","doi-asserted-by":"crossref","unstructured":"Roetteler, M., Naehrig, M., Svore, K.M., Lauter, K.: Quantum resource estimates for computing elliptic curve discrete logarithms. In: Advances in Cryptology\u2013AsiaCrypt 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, 3\u20137 December 2017, Proceedings, Part II 23, pp. 241\u2013270. Springer (2017)","DOI":"10.1007\/978-3-319-70697-9_9"},{"key":"11_CR53","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Fast multiplication of large numbers. Computing 7, 281\u2013292 (1971)","journal-title":"Computing"},{"key":"11_CR54","doi-asserted-by":"crossref","unstructured":"Shi, G., Wang, G., Gu, D.: Further cryptanalysis of a type of RSA variants. In: Information Security: 25th International Conference, ISC 2022, Bali, Indonesia, 18\u201322 December 2022, Proceedings, pp. 133\u2013152. Springer (2022)","DOI":"10.1007\/978-3-031-22390-7_9"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"2","key":"11_CR56","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"issue":"2","key":"11_CR57","first-page":"184","volume":"6","author":"Y Takahashi","year":"2006","unstructured":"Takahashi, Y., Kunihiro, N.: A quantum circuit for Shor\u2019s factoring algorithm using 2n+ 2 qubits. Quantum Inf. Comput. 6(2), 184\u2013192 (2006)","journal-title":"Quantum Inf. Comput."},{"key":"11_CR58","doi-asserted-by":"crossref","unstructured":"Takayasu, A., Kunihiro, N.: Cryptanalysis of RSA with multiple small secret exponents. In: Information Security and Privacy: 19th Australasian Conference, ACISP 2014, Wollongong, NSW, Australia, 7\u20139 July 2014, Proceedings 19, pp. 176\u2013191. Springer (2014)","DOI":"10.1007\/978-3-319-08344-5_12"},{"key":"11_CR59","doi-asserted-by":"crossref","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound. In: Selected Areas in Cryptography\u2013SAC 2014: 21st International Conference, Montreal, QC, Canada, 14\u201315 August 2014, Revised Selected Papers, pp. 345\u2013362. Springer (2014)","DOI":"10.1007\/978-3-319-13051-4_21"},{"key":"11_CR60","first-page":"100457","volume":"29","author":"H Thapliyal","year":"2021","unstructured":"Thapliyal, H., Mu\u00f1oz-Coreas, E., Khalus, V.: Quantum circuit designs of carry lookahead adder optimized for T-count T-depth and qubits. Sustain. Comput.: Inform. Syst. 29, 100457 (2021)","journal-title":"Sustain. Comput.: Inform. Syst."},{"issue":"9 &10","key":"11_CR61","first-page":"721","volume":"20","author":"I Van Hoof","year":"2020","unstructured":"Van Hoof, I.: Space-efficient quantum multiplication polynomials for binary finite fields with sub-quadratoc toffoli gate count. Quantum Inf. Comput. 20(9 &10), 721\u2013735 (2020)","journal-title":"Quantum Inf. Comput."},{"key":"11_CR62","unstructured":"Van\u00a0Meter, R.: A# quantumcomputerarchitecture tweetstorm (2019)"},{"issue":"1","key":"11_CR63","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1103\/PhysRevA.54.147","volume":"54","author":"V Vedral","year":"1996","unstructured":"Vedral, V., Barenco, A., Ekert, A.: Quantum networks for elementary arithmetic operations. Phys. Rev. A 54(1), 147 (1996)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"11_CR64","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/CC.2018.8300269","volume":"15","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Zhang, H., Wang, H.: Quantum polynomial-time fixed-point attack for RSA. China Commun. 15(2), 25\u201332 (2018)","journal-title":"China Commun."},{"key":"11_CR65","doi-asserted-by":"crossref","unstructured":"Wardhani, R.W., Putranto, D.S.C., Cho, J., Kim, H.: A highly efficient ECPM quantum circuit for binary elliptic curve cryptanalysis. IEEE Access (2024)","DOI":"10.1109\/ACCESS.2024.3489552"},{"key":"11_CR66","doi-asserted-by":"crossref","unstructured":"Wardhani, R.W., Putranto, D.S.C., Kim, H.: Quantum circuits for high-degree and half-multiplication for post-quantum analysis. In: International Conference on Information Security and Cryptology, pp. 140\u2013160. Springer (2023)","DOI":"10.1007\/978-981-97-1235-9_8"},{"key":"11_CR67","doi-asserted-by":"crossref","unstructured":"Wardhani, R.W., Putranto, D.S.C., Kim, H.: High-and half-degree quantum multiplication for post-quantum security evaluation. IEEE Access (2024)","DOI":"10.1109\/ACCESS.2024.3352157"},{"key":"11_CR68","unstructured":"Zalka, C.: Fast versions of Shor\u2019s quantum factoring algorithm. arXiv preprint quant-ph\/9806084 (1998)"},{"key":"11_CR69","unstructured":"Zalka, C.: Shor\u2019s algorithm with fewer (pure) qubits. arXiv preprint quant-ph\/0601097 (2006)"},{"key":"11_CR70","doi-asserted-by":"crossref","unstructured":"Zheng, M., Kunihiro, N., Hu, H.: Cryptanalysis of RSA variants with modified Euler quotient. In: Progress in Cryptology\u2013AfricaCrypt 2018: 10th International Conference on Cryptology in Africa, Marrakesh, Morocco, 7\u20139 May 2018, Proceedings 10, pp. 266\u2013281. Springer (2018)","DOI":"10.1007\/978-3-319-89339-6_15"},{"key":"11_CR71","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2021.08.001","volume":"889","author":"M Zheng","year":"2021","unstructured":"Zheng, M., Kunihiro, N., Yao, Y.: Cryptanalysis of the RSA variant based on cubic Pell equation. Theoret. Comput. Sci. 889, 135\u2013144 (2021)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-5566-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T20:23:24Z","timestamp":1749846204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-5566-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819655656","9789819655663"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-5566-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"14 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}