{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T03:51:14Z","timestamp":1768967474366,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031088957","type":"print"},{"value":"9783031088964","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08896-4_20","type":"book-chapter","created":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T14:33:50Z","timestamp":1658586830000},"page":"379-402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["$$T{-}depth$$ Reduction Method for\u00a0Efficient $$SHA{-}256$$ Quantum Circuit Construction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3493-7278","authenticated-orcid":false,"given":"Jongheon","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4632-8322","authenticated-orcid":false,"given":"Sokjoon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2002-2162","authenticated-orcid":false,"given":"You-Seok","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5625-4067","authenticated-orcid":false,"given":"Dooho","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,24]]},"reference":[{"key":"20_CR1","unstructured":"Forouzan, B.A., Mukhopadhyay, D.: Cryptography and Network Security. Mc Graw Hill Education (India) Private Limited, New York (2015)"},{"key":"20_CR2","unstructured":"NIST, FIPS PUB.: 180\u20134 Secure Hash Standard (SHS) (2015)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (1996)","DOI":"10.1145\/237814.237866"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-45724-2_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Jaques","year":"2020","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing Grover oracles for quantum key search on AES and LowMC. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 280\u2013310. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_10"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-319-69453-5_18","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"M Amy","year":"2017","unstructured":"Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., Schanck, J.: Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 317\u2013337. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_18"},{"issue":"12","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2107-3","volume":"17","author":"P Kim","year":"2018","unstructured":"Kim, P., Han, D., Jeong, K.C.: Time\u2013space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2. Quantum Inf. Process. 17(12), 1\u201339 (2018). https:\/\/doi.org\/10.1007\/s11128-018-2107-3","journal-title":"Quantum Inf. Process."},{"key":"20_CR7","unstructured":"Cuccaro, S.A., et al.: A new quantum ripple-carry addition circuit. arXiv preprint quant-ph\/0410184 (2004)"},{"key":"20_CR8","unstructured":"Beauregard, S., Gilles, B., Jos\u00e9, M.F.: Quantum arithmetic on Galois fields. arXiv preprint quant-ph\/0301163 (2003)"},{"issue":"6","key":"20_CR9","first-page":"440","volume":"5","author":"Y Takahashi","year":"2005","unstructured":"Takahashi, Y., Noboru, K.: A linear-size quantum circuit for addition with no ancillary qubits. Quantum Inf. Comput. 5(6), 440\u2013448 (2005)","journal-title":"Quantum Inf. Comput."},{"key":"20_CR10","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"},{"key":"20_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139034807","volume-title":"Quantum Error Correction","author":"DA Lidar","year":"2013","unstructured":"Lidar, D.A., Todd, A.B.: Quantum Error Correction. Cambridge University Press, Cambridge (2013)"},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., et al.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Selinger, P.: Quantum circuits of T-depth one. Phys. Rev. A 87(4), 042302 (2013)","DOI":"10.1103\/PhysRevA.87.042302"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1103\/PhysRevA.54.147","volume":"54","author":"V Vedral","year":"1996","unstructured":"Vedral, V., Adriano, B., Artur, E.: Quantum networks for elementary arithmetic operations. Phys. Rev. A 54(1), 147 (1996)","journal-title":"Phys. Rev. A"},{"issue":"10","key":"20_CR15","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","volume":"33","author":"M Amy","year":"2014","unstructured":"Amy, M., Dmitri, M., Michele, M.: Polynomial-time T-depth optimization of Clifford+ T circuits via matroid partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10), 1476\u20131489 (2014)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Isaac, C.: Quantum computation & quantum information, pp. 558\u2013559 (2002)","DOI":"10.1119\/1.1463744"},{"key":"20_CR17","unstructured":"Sun, W., et al.: Design and optimized implementation of the SHA-2 (256, 384, 512) hash algorithms. In: 2007 7th International Conference on ASIC. IEEE (2007)"},{"issue":"6","key":"20_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.compeleceng.2005.07.001","volume":"31","author":"I Ahmad","year":"2005","unstructured":"Ahmad, I., Das, A.S.: Hardware implementation analysis of SHA-256 and SHA-512 algorithms on FPGAs. Comput. Electr. Eng. 31(6), 345\u2013360 (2005)","journal-title":"Comput. Electr. Eng."},{"key":"20_CR19","unstructured":"Draper, T.G., et al.: A logarithmic-depth quantum carry-lookahead adder. arXiv preprint quant-ph\/0406142 (2004)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Buhrman, H., et al.: New limits on fault-tolerant quantum computation. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006). IEEE (2006)","DOI":"10.1109\/FOCS.2006.50"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Fowler, A.G., Ashley, M.S., Peter, G.: High-threshold universal quantum computation on the surface code. Phys. Rev. A 80(5), 052312 (2009)","DOI":"10.1103\/PhysRevA.80.052312"},{"key":"20_CR22","unstructured":"Fowler, A.G.: Time-optimal quantum computation. arXiv preprint arXiv:1210.4626 (2012)"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"74","DOI":"10.22331\/q-2018-06-18-74","volume":"2","author":"C Gidney","year":"2018","unstructured":"Gidney, C.: Halving the cost of quantum addition. Quantum 2, 74 (2018)","journal-title":"Quantum"},{"issue":"1","key":"20_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41534-018-0072-4","volume":"4","author":"Y Nam","year":"2018","unstructured":"Nam, Y., et al.: Automated optimization of large quantum circuits with continuous parameters. NPJ Quantum Inf. 4(1), 1\u201312 (2018)","journal-title":"NPJ Quantum Inf."},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-08494-7_10","volume-title":"Reversible Computation","author":"MZ Rahman","year":"2014","unstructured":"Rahman, M.Z., Rice, J.E.: Templates for positive and negative control Toffoli networks. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 125\u2013136. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08494-7_10"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-08494-7_12","volume-title":"Reversible Computation","author":"N Abdessaied","year":"2014","unstructured":"Abdessaied, N., Soeken, M., Drechsler, R.: Quantum circuit optimization by Hadamard gate reduction. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 149\u2013162. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08494-7_12"},{"key":"20_CR27","unstructured":"Garcia, E., Juan, C., Pedro, C.P.: Equivalent quantum circuits. arXiv preprint arXiv:1110.2998 (2011)"},{"issue":"5","key":"20_CR28","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)","journal-title":"Phys. Rev. A"},{"key":"20_CR29","unstructured":"Maslov, D., Gerhard, W., Michael, M.: Simplification of Toffoli networks via templates. In: IEEE Proceedings of 16th Symposium on Integrated Circuits and Systems Design, SBCCI 2003 (2003)"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Miller, D., Dmitri, M., Gerhard, D.: A transformation based algorithm for reversible logic synthesis. In: Proceedings of 2003 Design Automation Conference (IEEE Cat. no. 03ch37451). IEEE (2003)","DOI":"10.1145\/775832.775915"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08896-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T14:35:22Z","timestamp":1658586922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08896-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031088957","9783031088964"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08896-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 July 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","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":"icisc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/static\/callforpapers","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","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":"23","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":"37% - 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","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)"}}]}}