{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T20:07:47Z","timestamp":1783714067208,"version":"3.55.0"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T00:00:00Z","timestamp":1692144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Centro Nazionale di Ricerca in HPC, Big Data and Quantum computing \u2014 SPOKE 10"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Quantum Comput."],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>\n            Code-based cryptosystems are a promising option for Post-Quantum Cryptography, as neither classical nor quantum algorithms provide polynomial time solvers for their underlying hard problem. Indeed, to provide sound alternatives to lattice-based cryptosystems, U.S. National Institute of Standards and Technology (NIST) advanced all round 3 code-based cryptosystems to round 4 of its Post-Quantum standardization initiative. We present a complete implementation of a quantum circuit based on the Information Set Decoding (ISD) strategy, the best known one against code-based cryptosystems, providing quantitative measures for the security margin achieved with respect to the quantum-accelerated key recovery on AES, targeting both the current state-of-the-art approach and the NIST estimates. Our work improves the state-of-the-art, reducing the circuit depth by 2\n            <jats:sup>19<\/jats:sup>\n            to 2\n            <jats:sup>30<\/jats:sup>\n            for all the parameters of the NIST selected cryptosystems, mainly due to an improved quantum Gauss\u2013Jordan elimination circuit with respect to previous proposals. We show how our Prange\u2019s-based quantum ISD circuit reduces the security margin with respect to its classical counterpart. Finally, we address the concern brought forward in the latest NIST report on the parameters choice for the McEliece cryptosystem, showing that its parameter choice yields a computational effort slightly below the required target level.\n          <\/jats:p>","DOI":"10.1145\/3607256","type":"journal-article","created":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T12:09:23Z","timestamp":1688645363000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Improving the Efficiency of Quantum Circuits for Information Set Decoding"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9656-7252","authenticated-orcid":false,"given":"Simone","family":"Perriello","sequence":"first","affiliation":[{"name":"Department of Electronics, Information and Bioengineering, Politecnico di Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0840-6358","authenticated-orcid":false,"given":"Alessandro","family":"Barenghi","sequence":"additional","affiliation":[{"name":"Department of Electronics, Information and Bioengineering, Politecnico di Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3812-5429","authenticated-orcid":false,"given":"Gerardo","family":"Pelosi","sequence":"additional","affiliation":[{"name":"Department of Electronics, Information and Bioengineering, Politecnico di Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"key":"e_1_3_3_2_2","first-page":"1","volume-title":"Proceedings of the 15th Annual ACM Symposium on Theory of Computing","author":"Ajtai Mikl\u00f3s","year":"1983","unstructured":"Mikl\u00f3s Ajtai, J\u00e1nos Koml\u00f3s, and Endre Szemer\u00e9di. 1983. An O(n log n) sorting network. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, and Joel I. Seiferas (Eds.). ACM, 1\u20139. 10.1145\/800061.808726"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"e_1_3_3_4_2","unstructured":"Nicolas Aragon Paulo S. L. M. Barreto Slim Bettaieb Lo\u00efc Bidoux Olivier Blazy et\u00a0al. 2017. BIKE: Bit Flipping Key Encapsulation. Retrieved from https:\/\/bikesuite.org."},{"key":"e_1_3_3_5_2","unstructured":"Atos. 2019. Quantum Learning Machine . Retrieved from https:\/\/atos.net\/en\/solutions\/quantum-learning-machine."},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12100209"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_3_3_8_2","series-title":"Proceedings of the 22nd International Symposium on the Fundamentals of Computation Theory (FCT\u201919)","first-page":"126","author":"B\u00e4rtschi Andreas","year":"2019","unstructured":"Andreas B\u00e4rtschi and Stephan J. Eidenbenz. 2019. Deterministic preparation of dicke states. In Proceedings of the 22nd International Symposium on the Fundamentals of Computation Theory (FCT\u201919)Lecture Notes in Computer Science, Vol. 11651, Leszek Antoni Gasieniec, Jesper Jansson, and Christos Levcopoulos (Eds.). Springer, 126\u2013139. 10.1007\/978-3-030-25027-0_9"},{"key":"e_1_3_3_9_2","series-title":"Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT\u201912),","first-page":"520","author":"Becker Anja","year":"2012","unstructured":"Anja Becker, Antoine Joux, Alexander May, and Alexander Meurer. 2012. Decoding random binary linear codes in 2 n\/20: How 1 + 1 = 0 improves information set decoding. In Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT\u201912),Lecture Notes in Computer Science, Vol. 7237, David Pointcheval and Thomas Johansson (Eds.). Springer, 520\u2013536. 10.1007\/978-3-642-29011-4_31"},{"key":"e_1_3_3_10_2","unstructured":"Emanuele Bellini and Andre Esser. 2021. Syndrome Decoding Estimator. Retrieved from https:\/\/github.com\/Crypto-TII\/syndrome_decoding_estimator."},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12929-2_6"},{"key":"e_1_3_3_13_2","unstructured":"Daniel J. Bernstein Tung Chou Tanja Lange Ingo von Maurich Rafael Misoczki Ruben Niederhagen Edoardo Persichetti Christiane Peters Peter Schwabe Nicolas Sendrier Jakub Szefer and Wen Wang. 2020. Classic McEliece: Conservative Code-based Cryptography. Retrieved from https:\/\/classic.mceliece.org\/nist\/mceliece-20201010.pdf."},{"key":"e_1_3_3_14_2","series-title":"Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT\u201920), Part III,","first-page":"183","author":"Beullens Ward","year":"2020","unstructured":"Ward Beullens. 2020. Sigma protocols for MQ, PKP and SIS, and fishy signature schemes. In Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT\u201920), Part III,Lecture Notes in Computer Science, Vol. 12107, Anne Canteaut and Yuval Ishai (Eds.). Springer, 183\u2013211. 10.1007\/978-3-030-45727-3_7"},{"key":"e_1_3_3_15_2","series-title":"Proceedings of the 12th International Conference on Cryptology in Africa (AFRICACRYPT\u201920),","first-page":"45","author":"Biasse Jean-Fran\u00e7ois","year":"2020","unstructured":"Jean-Fran\u00e7ois Biasse, Giacomo Micheli, Edoardo Persichetti, and Paolo Santini. 2020. LESS is more: Code-based signatures without syndromes. In Proceedings of the 12th International Conference on Cryptology in Africa (AFRICACRYPT\u201920),Lecture Notes in Computer Science, Vol. 12174, Abderrahmane Nitaj and Amr M. Youssef (Eds.). Springer, 45\u201365. 10.1007\/978-3-030-51938-4_3"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-018-0296-3"},{"issue":"4","key":"e_1_3_3_17_2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","article-title":"Tight bounds on quantum searching","volume":"46","author":"Boyer Michel","year":"1998","unstructured":"Michel Boyer, Gilles Brassard, Peter H\u00f8yer, and Alain Tapp. 1998. Tight bounds on quantum searching. Fortschr. Phys.: Progr. Phys. 46, 4-5 (1998), 493\u2013505.","journal-title":"Fortschr. Phys.: Progr. Phys."},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00084-3"},{"key":"e_1_3_3_19_2","article-title":"An efficient key recovery attack on SIDH (Preliminary Version)","author":"Castryck Wouter","year":"2022","unstructured":"Wouter Castryck and Thomas Decru. 2022. An efficient key recovery attack on SIDH (Preliminary Version). Cryptology ePrint Archive, Paper 2022\/975.","journal-title":"Cryptology ePrint Archive, Paper 2022\/975"},{"key":"e_1_3_3_20_2","volume-title":"Introduction to Algorithms, Second Edition","author":"Cormen Thomas H.","year":"2001","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms, Second Edition. The MIT Press and McGraw\u2013Hill."},{"key":"e_1_3_3_21_2","unstructured":"Steven A. Cuccaro Thomas G. Draper Samuel A. Kutin and David Petrie Moulton. 2004. A new quantum ripple-carry addition circuit. 10.48550\/ARXIV.QUANT-PH\/0410184"},{"key":"e_1_3_3_22_2","series-title":"Proceedings of the 27th International Conference on Selected Areas in Cryptography (SAC\u201920), Revised Selected Papers,","first-page":"360","author":"Davenport James H.","year":"2020","unstructured":"James H. Davenport and Benjamin Pring. 2020. Improvements to quantum search techniques for block-ciphers, with applications to AES. In Proceedings of the 27th International Conference on Selected Areas in Cryptography (SAC\u201920), Revised Selected Papers,Lecture Notes in Computer Science, Vol. 12804. Orr Dunkelman, Michael J. Jacobson Jr., and Colin O\u2019Flynn (Eds.). Springer, 360\u2013384. 10.1007\/978-3-030-81652-0_14"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10773-017-3340-8"},{"key":"e_1_3_3_24_2","unstructured":"Thomas G. Draper. 2000. Addition on a quantum computer. 10.48550\/ARXIV.QUANT-PH\/0008033"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.26421\/QIC6.4-5-4"},{"key":"e_1_3_3_26_2","series-title":"Proceedings of the 25th IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC\u201922), Part I,","first-page":"112","author":"Esser Andre","year":"2022","unstructured":"Andre Esser and Emanuele Bellini. 2022. Syndrome decoding estimator. In Proceedings of the 25th IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC\u201922), Part I,Lecture Notes in Computer Science, Vol. 13177, Goichiro Hanaoka, Junji Shikata, and Yohei Watanabe (Eds.). Springer, 112\u2013141. 10.1007\/978-3-030-97121-2_5"},{"key":"e_1_3_3_27_2","article-title":"An optimized quantum implementation of ISD on scalable quantum resources","author":"Esser Andre","year":"2021","unstructured":"Andre Esser, Sergi Ramos-Calderer, Emanuele Bellini, Jos\u00e9 I. Latorre, and Marc Manzano. 2021. An optimized quantum implementation of ISD on scalable quantum resources. Cryptology ePrint Archive, Paper 2021\/1608.","journal-title":"Cryptology ePrint Archive, Paper 2021\/1608"},{"key":"e_1_3_3_28_2","unstructured":"European Telecommunications Standards Institute (ETSI). 2020. Quantum-safe cryptography. Retrieved from https:\/\/www.etsi.org\/technologies\/quantum-safe-cryptography."},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-06-18-74"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"e_1_3_3_31_2","series-title":"Proceedings of the 7th International Workshop on Post-Quantum Cryptography (PQCrypto\u201916),","first-page":"29","author":"Grassl Markus","year":"2016","unstructured":"Markus Grassl, Brandon Langenberg, Martin Roetteler, and Rainer Steinwandt. 2016. Applying Grover\u2019s algorithm to AES: Quantum resource estimates. In Proceedings of the 7th International Workshop on Post-Quantum Cryptography (PQCrypto\u201916),Lecture Notes in Computer Science, Vol. 9606, Tsuyoshi Takagi (Ed.). Springer, 29\u201343. 10.1007\/978-3-319-29360-8_3"},{"key":"e_1_3_3_32_2","first-page":"212","volume-title":"Proceedings of the 28th Annual ACM Symposium on the Theory of Computing","author":"Grover Lov K.","year":"1996","unstructured":"Lov K. Grover. 1996. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Gary L. Miller (Ed.). ACM, 212\u2013219. 10.1145\/237814.237866"},{"key":"e_1_3_3_33_2","series-title":"Proceedings of the 28th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT\u201922), Part III,","first-page":"614","author":"Huang Zhenyu","year":"2022","unstructured":"Zhenyu Huang and Siwei Sun. 2022. Synthesizing quantum circuits of AES with lower T-depth and less qubits. In Proceedings of the 28th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT\u201922), Part III,Lecture Notes in Computer Science, Vol. 13793. Shweta Agrawal and Dongdai Lin (Eds.). Springer, 614\u2013644. 10.1007\/978-3-031-22969-5_21"},{"key":"e_1_3_3_34_2","article-title":"Quantum analysis of AES","author":"Jang Kyungbae","year":"2022","unstructured":"Kyungbae Jang, Anubhab Baksi, Gyeongju Song, Hyunji Kim, Hwajeong Seo, and Anupam Chattopadhyay. 2022. Quantum analysis of AES. Cryptology ePrint Archive, Paper 2022\/683.","journal-title":"Cryptology ePrint Archive, Paper 2022\/683"},{"key":"e_1_3_3_35_2","first-page":"44","volume-title":"Proceedings of the International Conference on Platform Technology and Service (PlatCon\u201922)","author":"Jang Kyungbae","year":"2022","unstructured":"Kyungbae Jang, Hyunji Kim, and Hwajeong Seo. 2022. Quantum Gauss-Jordan elimination for code in quantum. In Proceedings of the International Conference on Platform Technology and Service (PlatCon\u201922). IEEE, 44\u201347. 10.1109\/platcon55845.2022.9932108"},{"key":"e_1_3_3_36_2","unstructured":"David Jao Reza Azarderakhsh Matthew Campagna Craig Costello Luca De Feo Basil Hess Amir Jalali Brian Koziel Brian LaMacchia Patrick Longa et\u00a0al. 2019. Supersingular Isogeny Key Encapsulation SIKE. Retrieved from https:\/\/sike.org."},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","unstructured":"Samuel Jaques Michael Naehrig Martin Roetteler and Fernando Virdia. 2019. Implementing Grover Oracles for Quantum Key Search on AES and LowMC. 10.48550\/ARXIV.QUANT-PH\/0410184","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"e_1_3_3_38_2","series-title":"Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT\u201920), Part II,","first-page":"280","volume":"12106","author":"Jaques Samuel","year":"2020","unstructured":"Samuel Jaques, Michael Naehrig, Martin Roetteler, and Fernando Virdia. 2020. Implementing grover oracles for quantum key search on AES and LowMC. In Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT\u201920), Part II,Lecture Notes in Computer Science, Vol. 12106, Anne Canteaut and Yuval Ishai (Eds.), Vol. 12106. Springer, 280\u2013310. 10.1007\/978-3-030-45724-2_10"},{"key":"e_1_3_3_39_2","series-title":"Proceedings of the 39th Annual International Cryptology Conference (CRYPTO\u201919), Part I,","first-page":"32","author":"Jaques Samuel","year":"2019","unstructured":"Samuel Jaques and John M. Schanck. 2019. Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE. In Proceedings of the 39th Annual International Cryptology Conference (CRYPTO\u201919), Part I,Lecture Notes in Computer Science, Vol. 11692, Alexandra Boldyreva and Daniele Micciancio (Eds.). Springer, 32\u201361. 10.1007\/978-3-030-26948-7_2"},{"issue":"2","key":"e_1_3_3_40_2","doi-asserted-by":"crossref","first-page":"022328","DOI":"10.1103\/PhysRevA.87.022328","article-title":"Low-overhead constructions for the fault-tolerant toffoli gate","volume":"87","author":"Jones Cody","year":"2013","unstructured":"Cody Jones. 2013. Low-overhead constructions for the fault-tolerant toffoli gate. Phys. Rev. A 87, 2 (2013), 022328.","journal-title":"Phys. Rev. A"},{"key":"e_1_3_3_41_2","series-title":"Proceedings of the 8th International Workshop on Post-Quatnum Cryptography (PQCrypto\u201917),","first-page":"69","author":"Kachigar Ghazal","year":"2017","unstructured":"Ghazal Kachigar and Jean-Pierre Tillich. 2017. Quantum information set decoding algorithms. In Proceedings of the 8th International Workshop on Post-Quatnum Cryptography (PQCrypto\u201917),Lecture Notes in Computer Science, Vol. 10346. Tanja Lange and Tsuyoshi Takagi (Eds.). Springer, 69\u201389. 10.1007\/978-3-319-59879-6_5"},{"issue":"1","key":"e_1_3_3_42_2","first-page":"1","article-title":"Efficient decomposition methods for controlled-R n using a single ancillary qubit","volume":"8","author":"Kim Taewan","year":"2018","unstructured":"Taewan Kim and Byung-Soo Choi. 2018. Efficient decomposition methods for controlled-R n using a single ancillary qubit. Sci. Rep. 8, 1 (2018), 1\u20137.","journal-title":"Sci. Rep."},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2409842"},{"key":"e_1_3_3_44_2","volume-title":"The Art of Computer Programming, Volume III","author":"Knuth Donald Ervin","year":"1998","unstructured":"Donald Ervin Knuth. 1998. The Art of Computer Programming, Volume III, (2nd ed.). Addison-Wesley."},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2020.2965697"},{"key":"e_1_3_3_46_2","series-title":"Proceedings of theWorkshop on the Theory and Application of of Cryptographic Techniques (EUROCRYPT\u201988),","first-page":"275","author":"Lee Pil Joong","year":"1988","unstructured":"Pil Joong Lee and Ernest F. Brickell. 1988. An observation on the security of McEliece\u2019s public-key cryptosystem. In Proceedings of theWorkshop on the Theory and Application of of Cryptographic Techniques (EUROCRYPT\u201988),Lecture Notes in Computer Science, Vol. 330, Christoph G. G\u00fcnther (Ed.). Springer, 275\u2013280. 10.1007\/3-540-45961-8_25"},{"issue":"43","key":"e_1_3_3_47_2","first-page":"114","article-title":"A public-key cryptosystem based on algebraic","volume":"42","author":"McEliece Robert J.","year":"1978","unstructured":"Robert J. McEliece. 1978. A public-key cryptosystem based on algebraic. Cod. Thv 42, 43 (1978), 114\u2013116.","journal-title":"Cod. Thv"},{"key":"e_1_3_3_48_2","unstructured":"Carlos Aguilar Melchor Nicolas Aragon Slim Bettaieb Lo\u0131c Bidoux Olivier Blazy Jean-Christophe Deneuville Philippe Gaborit Edoardo Persichetti Gilles Z\u00e9mor and IC Bourges. 2018. Hamming quasi-cyclic (HQC). Retrieved from https:\/\/pqc-hqc.org\/."},{"key":"e_1_3_3_49_2","first-page":"2069","volume-title":"Proceedings of the IEEE International Symposium on Information Theory","author":"Misoczki Rafael","year":"2013","unstructured":"Rafael Misoczki, Jean-Pierre Tillich, Nicolas Sendrier, and Paulo S. L. M. Barreto. 2013. MDPC-McEliece: New McEliece variants from moderate density parity-check codes. In Proceedings of the IEEE International Symposium on Information Theory. IEEE, 2069\u20132073. 10.1109\/ISIT.2013.6620590"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.IR.8413"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2020.3041479"},{"key":"e_1_3_3_52_2","unstructured":"National Institute of Standards and Technology. 2016. Announcing Request for Nominations for Public-Key Post-Quantum Cryptographic Algorithms. Retrieved from https:\/\/federalregister.gov\/a\/2016-30615."},{"key":"e_1_3_3_53_2","unstructured":"National Institute of Standards and Technology. 2016. Submission Requirements and Evaluation Criteria for the Post-Quantum Cryptography Standardization Process. Retrieved from https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf."},{"key":"e_1_3_3_54_2","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen Michael A.","year":"2010","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2010. Quantum Computation and Quantum Information. Cambridge University Press."},{"key":"e_1_3_3_55_2","first-page":"366","volume-title":"Proceedings of the IEEE International Conference on Quantum Computing and Engineering, (QCE\u201921)","author":"Perriello Simone","year":"2021","unstructured":"Simone Perriello, Alessandro Barenghi, and Gerardo Pelosi. 2021. A complete quantum circuit to solve the information set decoding problem. In Proceedings of the IEEE International Conference on Quantum Computing and Engineering, (QCE\u201921), Hausi A. M\u00fcller, Greg Byrd, Candace Culhane, and Travis Humble (Eds.). IEEE, 366\u2013377. 10.1109\/QCE52317.2021.00056"},{"key":"e_1_3_3_56_2","series-title":"Proceedings of the 17th EAI International Conference on Security and Privacy in Communication Networks (SecureComm\u201921), Part II,","first-page":"458","author":"Perriello Simone","year":"2021","unstructured":"Simone Perriello, Alessandro Barenghi, and Gerardo Pelosi. 2021. A quantum circuit to speed-up the cryptanalysis of code-based cryptosystems. In Proceedings of the 17th EAI International Conference on Security and Privacy in Communication Networks (SecureComm\u201921), Part II,Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, Vol. 399, Joaqu\u00edn Garc\u00eda-Alfaro, Shujun Li, Radha Poovendran, Herv\u00e9 Debar, and Moti Yung (Eds.). Springer, 458\u2013474. 10.1007\/978-3-030-90022-9_25"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","DOI":"10.26421\/QIC3.4-3"},{"issue":"6","key":"e_1_3_3_59_2","doi-asserted-by":"crossref","first-page":"062318","DOI":"10.1103\/PhysRevA.87.062318","article-title":"Linear-depth quantum circuits for n-Qubit Toffoli gates with no ancilla","volume":"87","author":"Saeedi Mehdi","year":"2013","unstructured":"Mehdi Saeedi and Massoud Pedram. 2013. Linear-depth quantum circuits for n-Qubit Toffoli gates with no ancilla. Phys. Rev. A 87, 6 (2013), 062318.","journal-title":"Phys. Rev. A"},{"issue":"4","key":"e_1_3_3_60_2","doi-asserted-by":"crossref","first-page":"042302","DOI":"10.1103\/PhysRevA.87.042302","article-title":"Quantum circuits of T-depth one","volume":"87","author":"Selinger Peter","year":"2013","unstructured":"Peter Selinger. 2013. Quantum circuits of T-depth one. Phys. Rev. A 87, 4 (2013), 042302.","journal-title":"Phys. Rev. A"},{"key":"e_1_3_3_61_2","series-title":"Proceedings of the 4th International Workshop on Post-Quantum Cryptography (PQCrypto\u201911),","first-page":"51","author":"Sendrier Nicolas","year":"2011","unstructured":"Nicolas Sendrier. 2011. Decoding one out of many. In Proceedings of the 4th International Workshop on Post-Quantum Cryptography (PQCrypto\u201911),Lecture Notes in Computer Science, Vol. 7071. Bo-Yin Yang (Ed.). Springer, 51\u201367. 10.1007\/978-3-642-25405-5_4"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_3_3_63_2","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"Proceedings of the 35th Annual Symposium on Foundations of Computer Science","author":"Shor Peter W.","year":"1994","unstructured":"Peter W. Shor. 1994. Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science. IEEE, 124\u2013134. 10.1109\/SFCS.1994.365700"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.26421\/QIC10.9-10-12"},{"key":"e_1_3_3_65_2","series-title":"Proceedings of the 7th International Workshop on Post-Quantum Cryptography (PQCrypto\u201916),","first-page":"144","author":"Torres Rodolfo Canto","year":"2016","unstructured":"Rodolfo Canto Torres and Nicolas Sendrier. 2016. Analysis of information set decoding for a sub-linear error weight. In Proceedings of the 7th International Workshop on Post-Quantum Cryptography (PQCrypto\u201916),Lecture Notes in Computer Science, Vol. 9606, Tsuyoshi Takagi (Ed.). Springer, 144\u2013161. 10.1007\/978-3-319-29360-8_10"},{"key":"e_1_3_3_66_2","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"Varshamov Rom Rubenovich","year":"1957","unstructured":"Rom Rubenovich Varshamov. 1957. Estimate of the number of signals in error correcting codes. Dokl. Akad. Nauk SSSR 117, 1 (1957), 739\u2013741.","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"4","key":"e_1_3_3_67_2","first-page":"1","article-title":"A quantum circuit design of AES requiring fewer quantum qubits and gate operations","volume":"17","author":"Wang Ze-Guo","year":"2022","unstructured":"Ze-Guo Wang, Shi-Jie Wei, and Gui-Lu Long. 2022. A quantum circuit design of AES requiring fewer quantum qubits and gate operations. Front. Phys. 17, 4 (2022), 1\u20137.","journal-title":"Front. Phys."},{"key":"e_1_3_3_68_2","series-title":"Proceedings of the 26th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT\u201920), Part II,","first-page":"697","author":"Zou Jian","year":"2020","unstructured":"Jian Zou, Zihao Wei, Siwei Sun, Ximeng Liu, and Wenling Wu. 2020. Quantum circuit implementations of AES with fewer qubits. In Proceedings of the 26th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT\u201920), Part II,Lecture Notes in Computer Science, Vol. 12492, Shiho Moriai and Huaxiong Wang (Eds.). Springer, 697\u2013726. 10.1007\/978-3-030-64834-3_24"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3607256","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3607256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:35Z","timestamp":1750178255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3607256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,16]]},"references-count":67,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12,31]]}},"alternative-id":["10.1145\/3607256"],"URL":"https:\/\/doi.org\/10.1145\/3607256","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,16]]},"assertion":[{"value":"2022-08-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-06-16","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-08-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}