{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:09:05Z","timestamp":1768316945805,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T00:00:00Z","timestamp":1702944000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T00:00:00Z","timestamp":1702944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272470"],"award-info":[{"award-number":["62272470"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272147"],"award-info":[{"award-number":["62272147"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Wuhan Science and Technology Bureau","award":["2022010801020328"],"award-info":[{"award-number":["2022010801020328"]}]},{"name":"Wuhan Science and Technology Bureau","award":["61902073"],"award-info":[{"award-number":["61902073"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-04182-z","type":"journal-article","created":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T16:02:46Z","timestamp":1703001766000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Further insights on constructing quantum circuits for Camellia block cipher"],"prefix":"10.1007","volume":"22","author":[{"given":"Da","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7403-8795","authenticated-orcid":false,"given":"Bing","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zejun","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunyu","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,19]]},"reference":[{"key":"4182_CR1","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Gary L. Miller, (ed), In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22\u201324, 1996, pp. 212\u2013219. ACM, (1996)","DOI":"10.1145\/237814.237866"},{"issue":"5","key":"4182_CR2","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"4182_CR3","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"4182_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.scib.2021.11.002","volume":"67","author":"Y Sheng","year":"2022","unstructured":"Sheng, Y., Zhou, L., Long, G.: One-step quantum secure direct communication. Sci. Bull. 67(4), 367\u2013374 (2022)","journal-title":"Sci. Bull."},{"issue":"4","key":"4182_CR5","doi-asserted-by":"publisher","first-page":"nwc228","DOI":"10.1093\/nsr\/nwac228","volume":"10","author":"H Yin","year":"2023","unstructured":"Yin, H., Fu, Y., Li, C., Weng, C., Li, B., Gu, J., Lu, Y., Huang, S., Chen, Z.: Experimental quantum secure network with digital signatures and encryption. Natl. Sci. Rev. 10(4), nwc228 (2023)","journal-title":"Natl. Sci. Rev."},{"issue":"2","key":"4182_CR6","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.020315","volume":"3","author":"Y Xie","year":"2022","unstructured":"Xie, Y., Lu, Y., Weng, C., Cao, X., Jia, Z., Bao, Y., Wang, Y., Fu, Y., Yin, H., Chen, Z.: Breaking the rate-loss bound of quantum key distribution with asynchronous two-photon interference. PRX Quantum 3(2), 020315 (2022)","journal-title":"PRX Quantum"},{"issue":"4","key":"4182_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-021-1843-7","volume":"65","author":"B Liu","year":"2022","unstructured":"Liu, B., Xia, S., Xiao, D., Huang, W., Xu, B., Li, Y.: Decoy-state method for quantum-key-distribution-based quantum private query. Sci. China Phys. Mech. Astron. 65(4), 240312 (2022)","journal-title":"Sci. China Phys. Mech. Astron."},{"key":"4182_CR8","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1038\/s42005-023-01238-5","volume":"6","author":"C Li","year":"2023","unstructured":"Li, C., Fu, Y., Liu, W., Xie, Y., Li, B., Zhou, M., Yin, H., Chen, Z.: Breaking universal limitations on quantum conference key agreement without quantum memory. Commun. Phys. 6, 122 (2023)","journal-title":"Commun. Phys."},{"issue":"1","key":"4182_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.fmre.2020.12.002","volume":"1","author":"H Guo","year":"2021","unstructured":"Guo, H., Li, Z., Yu, S., Zhang, Y.: Toward practical quantum key distribution using telecom components. Fundam. Res. 1(1), 96\u201398 (2021)","journal-title":"Fundam. Res."},{"issue":"6","key":"4182_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-023-2105-7","volume":"66","author":"A Shen","year":"2023","unstructured":"Shen, A., Cao, X., Wang, Y., Fu, Y., Gu, J., Liu, W., Weng, C., Yin, H., Chen, Z.: Experimental quantum secret sharing based on phase encoding of coherent states. Sci. China Phys. Mech. Astron. 66(6), 260311 (2023)","journal-title":"Sci. China Phys. Mech. Astron."},{"key":"4182_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s11128-023-04033-x","volume":"22","author":"A Zhang","year":"2023","unstructured":"Zhang, A., Zhao, S.: Evolutionary-based searching method for quantum circuit architecture. Quantum Inf. Process. 22, 283 (2023)","journal-title":"Quantum Inf. Process."},{"key":"4182_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s11128-022-03727-y","volume":"22","author":"X Wu","year":"2023","unstructured":"Wu, X., Li, Q., Li, Z., Yang, D., Yang, H., Pan, W., Perkowski, M., Song, X.: Circuit optimization of Grover quantum search algorithm. Quantum Inf. Process. 22, 69 (2023)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"4182_CR13","first-page":"1","volume":"2022","author":"X Bonnetain","year":"2022","unstructured":"Bonnetain, X., Jaques, S.: Quantum period finding against symmetric primitives in practice. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1), 1\u201327 (2022)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"4182_CR14","doi-asserted-by":"crossref","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. Springer, Information Security and Cryptography. (2002)","DOI":"10.1007\/978-3-662-04722-4"},{"key":"4182_CR15","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: The Keccak reference. (2011)"},{"key":"4182_CR16","unstructured":"NIST: Submission Rrequirements and Evaluation Criteria for the Post-Quantum Cryptography Standardization Process. https:\/\/csrc.nist.rip\/groups\/ST\/post-quantum-crypto\/documents\/call-for-proposals-final-dec-2016.pdf (2016)"},{"key":"4182_CR17","doi-asserted-by":"crossref","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., Steinwandt, R.: Applying grover\u2019s algorithm to AES: quantum resource estimates. In: Takagi,T., (eds.), Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, Feb 24-26, 2016, Proceedings, vol. 9606 of Lecture Notes in Computer Science, pp. 29\u201343. Springer, (2016)","DOI":"10.1007\/978-3-319-29360-8_3"},{"key":"4182_CR18","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s11128-018-1864-3","volume":"17","author":"M Almazrooie","year":"2018","unstructured":"Almazrooie, M., Samsudin, A., Abdullah, R., Mutter, K.N.: Quantum reversible circuit of AES-128. Quantum Inf. Process. 17, 112 (2018)","journal-title":"Quantum Inf. Process."},{"key":"4182_CR19","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s11128-018-2107-3","volume":"17","author":"P Kim","year":"2018","unstructured":"Kim, P., Han, D., Jeong, K.C.: Time-space complexity of quantum search algorithms in symmetric cryptanalysis: Applying to AES and SHA-2. Quantum Inf. Process. 17, 339 (2018)","journal-title":"Quantum Inf. Process."},{"key":"4182_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2020.2965697","volume":"1","author":"B Langenberg","year":"2020","unstructured":"Langenberg, B., Pham, H., Steinwandt, R.: Reducing the cost of implementing the advanced encryption standard as a quantum circuit. IEEE Trans. Quantum Eng. 1, 1 (2020)","journal-title":"IEEE Trans. Quantum Eng."},{"key":"4182_CR21","doi-asserted-by":"crossref","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.), Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part II, vol. 12106 of Lecture Notes in Computer Science, pp. 280-310. Springer, (2020)","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"4182_CR22","doi-asserted-by":"crossref","unstructured":"Zou, J., Wei, Z., Sun, S., Liu, X., Wu, W.: Quantum circuit implementations of aes with fewer qubits. In: Moriai, S., Wang, H. (eds.), Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part II, vol. 12492 of Lecture Notes in Computer Science, pp. 697\u2013726. Springer, (2020)","DOI":"10.1007\/978-3-030-64834-3_24"},{"key":"4182_CR23","doi-asserted-by":"crossref","unstructured":"Huang, Z., Sun, S.: Synthesizing quantum circuits of AES with lower t-depth and less qubits. In: Agrawal, S., Lin, D. (eds.), Advances in Cryptology - ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings, Part III, vol. 13793 of Lecture Notes in Computer Science, pp. 614\u2013644. Springer, (2022)","DOI":"10.1007\/978-3-031-22969-5_21"},{"key":"4182_CR24","first-page":"683","volume":"2022","author":"K Jang","year":"2022","unstructured":"Jang, K., Baksi, A., Song, G., Kim, H., Seo, H., Chattopadhyay, A.: Quantum analysis of AES. IACR Cryptol. ePrint Arch. 2022, 683 (2022)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"9","key":"4182_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-022-1921-y","volume":"65","author":"Z Li","year":"2022","unstructured":"Li, Z., Cai, B., Sun, H., Liu, H., Wan, L., Qin, S., Wen, Q., Gao, F.: Novel quantum circuit implementation of advanced encryption standard with low costs. Sci. China Phys. Mech. Astron. 65(9), 290311 (2022)","journal-title":"Sci. China Phys. Mech. Astron."},{"key":"4182_CR26","doi-asserted-by":"publisher","first-page":"41501","DOI":"10.1007\/s11467-021-1141-2","volume":"17","author":"Z Wang","year":"2022","unstructured":"Wang, Z., Wei, S., Long, G.: A quantum circuit design of AES requiring fewer quantum qubits and gate operations. Front. Phys. 17, 41501 (2022)","journal-title":"Front. Phys."},{"key":"4182_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s11128-022-03518-5","volume":"21","author":"J Zou","year":"2022","unstructured":"Zou, J., Li, L., Wei, Z., Luo, Y., Liu, Q., Wu, W.: New quantum circuit implementations of SM4 and SM3. Quantum Inf. Process. 21, 181 (2022)","journal-title":"Quantum Inf. Process."},{"key":"4182_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s11128-022-03477-x","volume":"21","author":"J Zou","year":"2022","unstructured":"Zou, J., Wei, Z., Sun, S., Luo, Y., Liu, Q., Wu, W.: Some efficient quantum circuit implementations of camellia. Quantum Inf. Process. 21, 131 (2022)","journal-title":"Quantum Inf. Process."},{"key":"4182_CR29","first-page":"018","volume":"2023","author":"Z Li","year":"2023","unstructured":"Li, Z., Gao, F., Qin, S., Wen, Q.: New record in the number of qubits for a quantum implementation of AES. IACR Cryptol. ePrint Arch. 2023, 018 (2023)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"4182_CR30","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s11128-023-04043-9","volume":"22","author":"D Lin","year":"2023","unstructured":"Lin, D., Xiang, Z., Xu, R., Zhang, S., Zeng, X.: Optimized quantum implementation of AES. Quantum Inf. Process. 22, 352 (2023)","journal-title":"Quantum Inf. Process."},{"key":"4182_CR31","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/s11128-023-04002-4","volume":"22","author":"D Lin","year":"2023","unstructured":"Lin, D., Xiang, Z., Xu, R., Zeng, X., Zhang, S.: Quantum circuit implementations of SM4 block cipher based on different gate sets. Quantum Inf. Process. 22, 282 (2023)","journal-title":"Quantum Inf. Process."},{"key":"4182_CR32","doi-asserted-by":"crossref","unstructured":"Chung, D., Lee, S., Choi, D., Lee. J.: Alternative Tower Field Construction for Quantum Implementation of the AES S-box. IEEE Trans. Comput. 71(10), 2553\u20132564 (2022)","DOI":"10.1109\/TC.2021.3135759"},{"issue":"4","key":"4182_CR33","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"key":"4182_CR34","unstructured":"Paar, C.: Optimized arithmetic for Reed-Solomon encoders. In: IEEE International Symposium on Information Theory, Ulm, Germany, Jun 29-July 04, 1997, pp. 250. IEEE, (1997)"},{"key":"4182_CR35","unstructured":"Boyar, J., Peralta, R.: A new combinational logic minimization technique with applications to cryptology. In: Festa, P. (eds), Experimental Algorithms - SEA 2010 - 9th International Symposium, Ischia Island, Naples, Italy, May 20-22, 2010, Proceedings, vol. 6049 of Lecture Notes in Computer Science, pp. 178\u2013189. Springer, (2010)"},{"key":"4182_CR36","doi-asserted-by":"crossref","unstructured":"Banik, S., Funabiki, Y., Isobe, T.: More results on shortest linear programs. In: Attrapadung, N., Yagi, T. (eds), Advances in Information and Computer Security - IWSEC 2019 - 14th International Workshop on Security, Tokyo, Japan, Aug 28-30, 2019, Proceedings, vol. 11689 of Lecture Notes in Computer Science, pp. 109\u2013128. Springer, (2019)","DOI":"10.1007\/978-3-030-26834-3_7"},{"issue":"1","key":"4182_CR37","first-page":"203","volume":"2020","author":"Q Tan","year":"2020","unstructured":"Tan, Q., Peyrin, T.: Improved heuristics for short linear programs. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(1), 203\u2013230 (2020)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"2","key":"4182_CR38","doi-asserted-by":"publisher","first-page":"120","DOI":"10.46586\/tosc.v2020.i2.120-145","volume":"2020","author":"Z Xiang","year":"2020","unstructured":"Xiang, Z., Zeng, X., Lin, D., Bao, Z., Zhang, S.: Optimizing implementations of linear layers. IACR Trans. Symmetric Cryptol. 2020(2), 120\u2013145 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"4182_CR39","doi-asserted-by":"crossref","unstructured":"Lin, D., Xiang, Z., Zeng, X., Zhang, S.: A framework to optimize implementations of matrices. In: Paterson, K.G. (eds), Topics in Cryptology - CT-RSA 2021 - Cryptographers\u2019 Track at the RSA Conference 2021, Virtual Event, May 17-20, 2021, Proceedings, vol. 12704 of Lecture Notes in Computer Science, pp. 609\u2013632. Springer, (2021)","DOI":"10.1007\/978-3-030-75539-3_25"},{"issue":"4","key":"4182_CR40","doi-asserted-by":"publisher","first-page":"130","DOI":"10.46586\/tosc.v2017.i4.130-168","volume":"2017","author":"J Jean","year":"2017","unstructured":"Jean, J., Peyrin, T., Sim, S.M., Tourteaux, J.: Optimizing implementations of lightweight building blocks. IACR Trans. Symmetric Cryptol. 2017(4), 130\u2013168 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"1","key":"4182_CR41","doi-asserted-by":"publisher","first-page":"330","DOI":"10.46586\/tosc.v2019.i1.330-394","volume":"2019","author":"Z Bao","year":"2019","unstructured":"Bao, Z., Guo, J., Ling, S., Sasaki, Y.: SoK: Peigen - a Platform for evaluation, implementation, and generation of S-boxes. IACR Trans. Symmetric Cryptol. 2019(1), 330\u2013394 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"1","key":"4182_CR42","doi-asserted-by":"publisher","first-page":"144","DOI":"10.46586\/tosc.v2020.i1.144-184","volume":"2020","author":"B Bilgin","year":"2020","unstructured":"Bilgin, B., De Meyer, L., Duval, S., Levi, I., Standaert, F.: X: Low and depth and efficient inverses: A guide on S-boxes for low-latency masking. IACR Trans. Symmetric Cryptol. 2020(1), 144\u2013184 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"4182_CR43","doi-asserted-by":"crossref","unstructured":"Dasu, V. A., Baksi, A., SarKar, S., Chattopadhyay, A.: LIGHTER-R: Optimized reversible circuit implementation for SBoxes. In: SOCC 2019 - 32nd IEEE International System-on-Chip Conference, Singapore, 03-06 Sept 2019, pp. 260\u2013265. IEEE, (2019)","DOI":"10.1109\/SOCC46988.2019.1570548320"},{"key":"4182_CR44","first-page":"286","volume":"2023","author":"M Chun","year":"2023","unstructured":"Chun, M., Baksi, A., Chattopadhyay, A.: DORCIS: Depth optimized quantum implementation of substitution boxes. IACR Cryptol. ePrint Arch. 2023, 286 (2023)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"4","key":"4182_CR45","doi-asserted-by":"publisher","DOI":"10.1360\/SSPMA-2022-0485","volume":"53","author":"Z Li","year":"2023","unstructured":"Li, Z., Gao, F., Qin, S., Wen, Q.: Quantum circuit for implementing Camellia S-box with low costs. Sci. Sin. Phys. Mech. Astron. 53(4), 240313 (2023)","journal-title":"Sci. Sin. Phys. Mech. Astron."},{"key":"4182_CR46","doi-asserted-by":"crossref","unstructured":"Aoki, K., Ichikawa, T., Kanda,M., Matsui,M., Moriai, S., Nakajima, J., Tokita, T.: Camellia: A 128-bit block cipher suitable for multiple platforms - design and analysis. In: Stinson, D R., Stafford E. Tavares, (eds.), Selected Areas in Cryptography - SAC 2000 - 7th Annual International Workshop, Waterloo, Ontario, Canada, August 14-15, 2000, Proceedings, vol. 2012 of Lecture Notes in Computer Science, pp. 39\u201356. Springer, (2000)","DOI":"10.1007\/3-540-44983-3_4"},{"key":"4182_CR47","unstructured":"Standardization administration of the P. R. China: GB\/T32907-2016, Information security technology-SM4 Block Cipher Algorithm, (2016)"},{"key":"4182_CR48","doi-asserted-by":"crossref","unstructured":"Amy, M., Maslov, D. Mosca, M., Roetteler, M.: 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)","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"4182_CR49","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Herrera, A.F., Mex-Perera, J.C., Nolazco-Flores, J.A.: Some Representations of the S-Box of Camellia in $$GF(((2^2)^2)^2)$$. In: Pieprzyk, J., Sadeghi, AR., Manulis, M. (eds), Cryptology and Network Security, 11th International Conference, CANS 2012, Darmstadt, Germany, Dec 12-14, 2012, Proceedings, vol. 7712 of Lecture Notes in Computer Science, pp. 296\u2013309. Springer, (2012)","DOI":"10.1007\/978-3-642-35404-5_22"},{"key":"4182_CR50","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Herrera, A.F., Mex-Perera, J.C., Nolazco-Flores, J.A.: Merging the Camellia, SMS4 and AES s-boxes in a single s-box with composite bases. In: Desmedt, Y. (eds.), 16th International Conference, ISC 2013, Dallas, Texas, Nov 13-15, 2013, Proceedings, vol. 7807 of Lecture Notes in Computer Science, pp. 209\u2013217. Springer, (2015)","DOI":"10.1007\/978-3-319-27659-5_15"},{"key":"4182_CR51","first-page":"738","volume":"2019","author":"Z Wei","year":"2019","unstructured":"Wei, Z., Sun, S., Hu, L., Wei, M., Boyar, J., Peralta, R.: Scrutinizing the tower field implementation of the $$\\mathbb{F} _{2^8}$$ inverter-with applications to AES, Camellia, and SM4. IACR Cryptol. ePrint Arch. 2019, 738 (2019)","journal-title":"IACR Cryptol. ePrint Arch."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04182-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-04182-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04182-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T18:14:53Z","timestamp":1703614493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-04182-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,19]]},"references-count":51,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["4182"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-04182-z","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,19]]},"assertion":[{"value":"19 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"455"}}