{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T14:59:51Z","timestamp":1771513191678,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819980239","type":"print"},{"value":"9789819980246","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-99-8024-6_23","type":"book-chapter","created":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T05:02:11Z","timestamp":1704862931000},"page":"297-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantum Circuit Designs of\u00a0Point Doubling Operation for\u00a0Binary Elliptic Curves"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6143-4134","authenticated-orcid":false,"given":"Harashta Tatimma","family":"Larasati","sequence":"first","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":[[2024,1,11]]},"reference":[{"issue":"1","key":"23_CR1","first-page":"451","volume":"2021","author":"G Banegas","year":"2021","unstructured":"Banegas, G., Bernstein, D.J., van Hoof, I., Lange, T.: Concrete quantum cryptanalysis of binary elliptic curves. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1), 451\u2013472 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"23_CR2","unstructured":"Gidney, C.: Asymptotically efficient quantum Karatsuba multiplication. arXiv preprint arXiv:1904.07356 (2019)"},{"key":"23_CR3","unstructured":"Gouzien, \u00c9., Ruiz, D., R\u00e9gent, F.M.L., Guillaud, J., Sangouard, N.: Computing 256-bit elliptic curve logarithm in 9 hours with 126133 cat qubits. arXiv preprint arXiv:2302.06639 (2023)"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"11229","DOI":"10.1038\/s41598-020-67014-5","volume":"10","author":"L Gyongyosi","year":"2020","unstructured":"Gyongyosi, L., Imre, S.: Circuit depth reduction for gate-model quantum computers. Sci. Rep. 10(1), 11229 (2020)","journal-title":"Sci. Rep."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-44223-1_23","volume-title":"Post-Quantum Cryptography","author":"T H\u00e4ner","year":"2020","unstructured":"H\u00e4ner, T., Jaques, S., Naehrig, M., Roetteler, M., Soeken, M.: Improved quantum circuits for elliptic curve discrete logarithms. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 425\u2013444. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_23"},{"key":"23_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b97644","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2006","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, New York (2006). https:\/\/doi.org\/10.1007\/b97644"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-031-25659-2_18","volume-title":"Information Security Applications","author":"K Jang","year":"2023","unstructured":"Jang, K., Kim, W., Lim, S., Kang, Y., Yang, Y., Seo, H.: Optimized implementation of quantum binary field multiplication with toffoli depth one. In: You, I., Youn, T.Y. (eds.) WISA 2022. LNCS, vol. 13720, pp. 251\u2013264. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-25659-2_18"},{"issue":"6","key":"23_CR8","first-page":"474","volume":"5","author":"P Kaye","year":"2005","unstructured":"Kaye, P.: Optimized quantum implementation of elliptic curve arithmetic over binary fields. Quantum Inf. Comput. 5(6), 474\u2013491 (2005)","journal-title":"Quantum Inf. Comput."},{"key":"23_CR9","unstructured":"Kirsch, Z., Chow, M.: Quantum computing: the risk to existing encryption methods (2015). http:\/\/www.cs.tufts.edu\/comp\/116\/archive\/fall2015\/zkirsch.pdf"},{"key":"23_CR10","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.S.C., 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"},{"issue":"7","key":"23_CR11","doi-asserted-by":"publisher","first-page":"955","DOI":"10.3390\/e24070955","volume":"24","author":"J Liu","year":"2022","unstructured":"Liu, J., Wang, H., Ma, Z., Duan, Q., Fei, Y., Meng, X.: Quantum circuit optimization for solving discrete logarithm of binary elliptic curves obeying the nearest-neighbor constrained. Entropy 24(7), 955 (2022)","journal-title":"Entropy"},{"key":"23_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102810","volume":"170","author":"F Orts","year":"2020","unstructured":"Orts, F., Ortega, G., Combarro, E.F., Garz\u00f3n, E.M.: A review on reversible quantum adders. J. Netw. Comput. Appl. 170, 102810 (2020)","journal-title":"J. Netw. Comput. Appl."},{"key":"23_CR13","unstructured":"Pornin, T.: Efficient and complete formulas for binary curves. Cryptology ePrint Archive (2022)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Proos, J., Zalka, C.: Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. arXiv preprint quant-ph\/0301141 (2003)","DOI":"10.26421\/QIC3.4-3"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"45083","DOI":"10.1109\/ACCESS.2023.3273601","volume":"11","author":"DSC Putranto","year":"2023","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 11, 45083\u201345097 (2023)","journal-title":"IEEE Access"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-70697-9_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"M Roetteler","year":"2017","unstructured":"Roetteler, M., Naehrig, M., Svore, K.M., Lauter, K.: Quantum resource estimates for computing elliptic curve discrete logarithms. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 241\u2013270. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_9"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"2","key":"23_CR18","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."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-031-30872-7_3","volume-title":"Topics in Cryptology-CT-RSA 2023","author":"R Taguchi","year":"2023","unstructured":"Taguchi, R., Takayasu, A.: Concrete quantum cryptanalysis of binary elliptic curves via addition chain. In: Rosulek, M. (ed.) CT-RSA 2023. LNCS, vol. 13871, pp. 57\u201383. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30872-7_3"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Van Hoof, I.: Space-efficient quantum multiplication of polynomials for binary finite fields with sub-quadratic Toffoli gate count. arXiv preprint arXiv:1910.02849 (2019)","DOI":"10.26421\/QIC20.9-10-1"},{"issue":"1","key":"23_CR21","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"},{"key":"23_CR22","unstructured":"Whaley, B., Karasik, R.: Circuits, randomized computation, deferred measurements (2007). https:\/\/inst.eecs.berkeley.edu\/~cs191\/fa07\/lectures\/lecture9_fa07.pdf"},{"key":"23_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-887-6","volume-title":"Explorations in Quantum Computing","author":"CP Williams","year":"2010","unstructured":"Williams, C.P.: Explorations in Quantum Computing. Springer, London (2010). https:\/\/doi.org\/10.1007\/978-1-84628-887-6"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8024-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T20:08:05Z","timestamp":1731010085000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8024-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819980239","9789819980246"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8024-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju Island","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wisa.or.kr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}