{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T14:35:12Z","timestamp":1785335712224,"version":"3.55.0"},"reference-count":40,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T00:00:00Z","timestamp":1709164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["51979048"],"award-info":[{"award-number":["51979048"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The SAND algorithm is a family of lightweight AND-RX block ciphers released by DCC in 2022. Our research focuses on assessing the security of SAND with a quantum computation model. This paper presents the first quantum implementation of SAND (including two versions of SAND, SAND-64 and SAND-128). Considering the depth-times-width metric, the quantum circuit implementation of the SAND algorithm demonstrates a relatively lower consumption of quantum resources than that of the quantum implementations of existing lightweight algorithms. A generalized Grover-based brute-force attack framework was implemented and employed to perform attacks on two versions of the SAND algorithm. This framework utilized the g-database algorithm, which considered different plaintext\u2013ciphertext pairs in a unified manner, reducing quantum resource consumption. Our findings indicate that the SAND-128 algorithm achieved the NIST security level I, while the SAND-64 algorithm fell short of meeting the requirements of security level I.<\/jats:p>","DOI":"10.3390\/e26030216","type":"journal-article","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T02:59:39Z","timestamp":1709175579000},"page":"216","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum Implementation of the SAND Algorithm and Its Quantum Resource Estimation for Brute-Force Attack"],"prefix":"10.3390","volume":"26","author":[{"given":"Hongyu","family":"Wu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoning","family":"Feng","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiale","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun 130012, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MSP.2018.3761723","article-title":"Cybersecurity in an era with quantum computers: Will we be ready?","volume":"16","author":"Mosca","year":"2018","journal-title":"IEEE Secur. Priv."},{"key":"ref_2","unstructured":"Schrottenloher, A. (2021). Quantum Algorithms for Cryptanalysis and Quantum-Safe Symmetric Cryptography. [Ph.D. Thesis, Sorbonne Universit\u00e9]."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_5","unstructured":"NIST (2022, October 15). Call for Additional Digital Signature Schemes for the Post-Quantum Cryptography Standardization Process 2022, Available online: https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/MC.2020.2984871","article-title":"The rise of the quantum internet","volume":"53","author":"Caleffi","year":"2020","journal-title":"Computer"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1039111.1039118","article-title":"Infrastructure for the quantum Internet","volume":"34","author":"Lloyd","year":"2004","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_8","first-page":"100457","article-title":"Quantum circuit designs of carry lookahead adder optimized for T-count T-depth and qubits","volume":"29","author":"Thapliyal","year":"2021","journal-title":"Sustain. Comput. Inform. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"015011","DOI":"10.1088\/2058-9565\/ad04e5","article-title":"T-depth-optimized quantum search with quantum data-access machine","volume":"9","author":"Park","year":"2023","journal-title":"Quantum Sci. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"54910","DOI":"10.1109\/ACCESS.2023.3280632","article-title":"Depth Optimization of FLT-Based Quantum Inversion Circuit","volume":"11","author":"Larasati","year":"2023","journal-title":"IEEE Access"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"12549","DOI":"10.1007\/s11227-023-05148-9","article-title":"Fault-tolerant quantum algorithm for dual-threshold image segmentation","volume":"79","author":"Orts","year":"2023","journal-title":"J. Supercomput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1038\/s41534-023-00707-7","article-title":"Error statistics and scalability of quantum error mitigation formulas","volume":"9","author":"Qin","year":"2023","journal-title":"NPJ Quantum Inf."},{"key":"ref_13","first-page":"041057","article-title":"Qubit-reuse compilation with mid-circuit measurement and reset","volume":"13","author":"DeCross","year":"2023","journal-title":"Phys. Rev. X"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Osvik, D.A., Bos, J.W., Stefan, D., and Canright, D. (2010). Proceedings of the International Workshop on Fast Software Encryption, Springer.","DOI":"10.1007\/978-3-642-13858-4_5"},{"key":"ref_15","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., and Steinwandt, R. (2016). Proceedings of the International Workshop on Post-Quantum Cryptography, Springer."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/s11128-018-1864-3","article-title":"Quantum reversible circuit of AES-128","volume":"17","author":"Almazrooie","year":"2018","journal-title":"Quantum Inf. Process."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., and Virdia, F. (2020, January 10\u201314). Implementing Grover oracles for quantum key search on AES and LowMC. Proceedings of the Advances in Cryptology\u2013EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia. Proceedings, Part II 30.","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"ref_18","unstructured":"Zou, J., Wei, Z., Sun, S., Liu, X., and Wu, W. (2020). Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Springer."},{"key":"ref_19","unstructured":"Huang, Z., and Sun, S. (2022). Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Springer."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1140\/epjqt\/s40507-022-00144-z","article-title":"Quantum reversible circuits for multiplicative inverse","volume":"9","author":"Luo","year":"2022","journal-title":"EPJ Quantum Technol."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Rajesh, S., Paul, V., Menon, V.G., and Khosravi, M.R. (2019). A secure and efficient lightweight symmetric encryption scheme for transfer of text files between embedded IoT devices. Symmetry, 11.","DOI":"10.3390\/sym11020293"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Singh, S., Sharma, P.K., Moon, S.Y., and Park, J.H. (2017). Advanced lightweight encryption algorithms for IoT devices: Survey, challenges and solutions. J. Ambient. Intell. Humaniz. Comput., 1\u201318.","DOI":"10.1007\/s12652-017-0494-4"},{"key":"ref_23","first-page":"999","article-title":"Quantum implementation of SM4","volume":"8","author":"LIN","year":"2021","journal-title":"J. Cryptologic Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s11128-022-03518-5","article-title":"New quantum circuit implementations of SM4 and SM3","volume":"21","author":"Zou","year":"2022","journal-title":"Quantum Inf. Process."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/s11128-021-03322-7","article-title":"Evaluation of Grover\u2019s algorithm toward quantum cryptanalysis on ChaCha","volume":"20","author":"Bathe","year":"2021","journal-title":"Quantum Inf. Process."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Jang, K., Choi, S., Kwon, H., Kim, H., Park, J., and Seo, H. (2020). Grover on Korean block ciphers. Appl. Sci., 10.","DOI":"10.3390\/app10186407"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Yang, Y., Jang, K., Baksi, A., and Seo, H. (2023). Optimized implementation and analysis of cham in quantum computing. Appl. Sci., 13.","DOI":"10.3390\/app13085156"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10623-021-00970-9","article-title":"SAND: An AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations","volume":"90","author":"Chen","year":"2022","journal-title":"Des. Codes Cryptogr."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"052402","DOI":"10.1103\/PhysRevA.102.052402","article-title":"Improved quantum algorithm for A-optimal projection","volume":"102","author":"Pan","year":"2020","journal-title":"Phys. Rev. A"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"033002","DOI":"10.1103\/PhysRevResearch.3.033002","article-title":"Holographic quantum algorithms for simulating correlated spin systems","volume":"3","author":"Hayes","year":"2021","journal-title":"Phys. Rev. Res."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Bonnetain, X., Hosoyamada, A., Naya-Plasencia, M., Sasaki, Y., and Schrottenloher, A. (2019, January 8\u201312). Quantum attacks without superposition queries: The offline Simon\u2019s algorithm. Proceedings of the Advances in Cryptology\u2013ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan. Proceedings, Part I.","DOI":"10.1007\/978-3-030-34578-5_20"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","article-title":"Quantum fingerprinting","volume":"87","author":"Buhrman","year":"2001","journal-title":"Phys. Rev. Lett."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Lu, D., Li, Z., Yu, J., and Han, Z. (2022). A verifiable arbitrated quantum signature scheme based on controlled quantum teleportation. Entropy, 24.","DOI":"10.3390\/e24010111"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Chen, F.L., Wang, Z.H., and Hu, Y.M. (2019). A new quantum blind signature scheme with BB84-state. Entropy, 21.","DOI":"10.3390\/e21040336"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Carstens, T.V., Ebrahimi, E., Tabia, G.N., and Unruh, D. (2021, January 8\u201311). Relationships between quantum IND-CPA notions. Proceedings of the Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA. Proceedings, Part I.","DOI":"10.1007\/978-3-030-90459-3_9"},{"key":"ref_36","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","year":"2013","journal-title":"Phys. Rev. A"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","article-title":"A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits","volume":"32","author":"Amy","year":"2013","journal-title":"IEEE Trans.-Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Jang, K., Baksi, A., Breier, J., Seo, H., and Chattopadhyay, A. (2023). Quantum implementation and analysis of default. Cryptogr. Commun., 1\u201317.","DOI":"10.1007\/s12095-023-00666-y"},{"key":"ref_39","unstructured":"Jang, K., Baksi, A., Kim, H., Seo, H., and Chattopadhyay, A. (2022). Proceedings of the International Conference on Cryptology in India, Springer."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"032324","DOI":"10.1103\/PhysRevA.86.032324","article-title":"Surface codes: Towards practical large-scale quantum computation","volume":"86","author":"Fowler","year":"2012","journal-title":"Phys. Rev. A"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/3\/216\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:06:54Z","timestamp":1760105214000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/3\/216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,29]]},"references-count":40,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["e26030216"],"URL":"https:\/\/doi.org\/10.3390\/e26030216","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,29]]}}}