{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T12:53:43Z","timestamp":1781787223474,"version":"3.54.5"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,7]]},"abstract":"Abstract<\/jats:title>\n \n With the development and practical application of technologies such as Fully Homomorphic Encryption (FHE), Secure Multi-Party Computation (MPC), and Zero-Knowledge Proof (ZK), it has become crucial to research the design and analysis of symmetric cryptographic primitives with low multiplicative complexity and depth. First, by using multiplication and addition over the finite field\n \n \n $$\\mathbb {F}_{q}$$<\/jats:tex-math>\n \n \n F<\/mml:mi>\n q<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , where\n \n \n $$q$$<\/jats:tex-math>\n \n q<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is either a prime number\n \n \n $$p$$<\/jats:tex-math>\n \n p<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n or\n \n \n $$2^{n}$$<\/jats:tex-math>\n \n \n 2<\/mml:mn>\n n<\/mml:mi>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , we proposed a non-linear function over\n \n \n $$\\mathbb {F}_{q}^{4}$$<\/jats:tex-math>\n \n \n F<\/mml:mi>\n \n q<\/mml:mi>\n <\/mml:mrow>\n 4<\/mml:mn>\n <\/mml:msubsup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n based on the generalized Feistel structure. This function features a multiplicative complexity of 4, a multiplicative depth of 2 and 8 additions, and its maximum differential\/linear probability of the function is bounded by\n \n \n $$q^{-2}$$<\/jats:tex-math>\n \n \n q<\/mml:mi>\n \n -<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . Then, we designed a family of HE-friendly block ciphers called DuX. We conduct a comprehensive security analysis of DuX within certain parameters against various cryptanalysis methods, including differential cryptanalysis, linear cryptanalysis, impossible differential cryptanalysis, zero-correlation linear cryptanalysis, integral analysis, related-key differential cryptanalysis, algebraic attacks, slide attacks, reflection attacks, and boomerang attacks. Our research indicates that DuX maintains a robust security margin against those attacks. Finally, based on the BGV scheme in HElib, we present a detailed homomorphic decryption implementation of the DuX instantiated with\n \n \n $$q = 2^{8}$$<\/jats:tex-math>\n \n \n q<\/mml:mi>\n =<\/mml:mo>\n \n 2<\/mml:mn>\n 8<\/mml:mn>\n <\/mml:msup>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n ,\n \n \n $$2^{16}$$<\/jats:tex-math>\n \n \n 2<\/mml:mn>\n 16<\/mml:mn>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n $$65537$$<\/jats:tex-math>\n \n \n 65537<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , respectively. The results show that, for the same block size, the throughput of the DuX-128 over\n \n \n $$\\mathbb {F}_{2^{8}}^{16}$$<\/jats:tex-math>\n \n \n F<\/mml:mi>\n \n \n 2<\/mml:mn>\n 8<\/mml:mn>\n <\/mml:msup>\n <\/mml:mrow>\n 16<\/mml:mn>\n <\/mml:msubsup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n can reach approximately 14.95 times, 7.85 times and 20.76 times that of the AES-128, Low MC-128 and CHAGHRI, respectively. Compared with YuX-128, its throughput has increased approximately by 21.59%.\n <\/jats:p>","DOI":"10.1007\/s10623-026-01855-5","type":"journal-article","created":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T12:16:12Z","timestamp":1781784972000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DuX: a block cipher for efficient FHE evaluation"],"prefix":"10.1007","volume":"94","author":[{"given":"You","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinfeng","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenzheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,18]]},"reference":[{"key":"1855_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht M.R., Rechberger C., Schneider T., Tiessen T., Zohner M.: Ciphers for MPC and FHE. In: Advances in Cryptology\u2014EUROCRYPT 2015. Lecture Notes in Computer Science, vol. 9057, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17.","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"1855_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht M.R., Grassi L., Rechberger C., Schofnegger M., Tiessen T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon J.H., Takagi T. (eds.) Advances in Cryptology\u2014ASIACRYPT 2016, Part I. Lecture Notes in Computer Science, vol. 10031, pp. 191\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7.","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"1855_CR3","doi-asserted-by":"publisher","unstructured":"Albrecht M.R., Cid C., Grassi L., Khovratovich D., L\u00fcftenegger R., Rechberger C., Schofnegger M.: Algebraic cryptanalysis of stark-friendly designs: application to MARVELlous and MiMC. In: Galbraith S.D., Moriai S. (eds.) Advances in Cryptology\u2014ASIACRYPT 2019. Lecture Notes in Computer Science, pp. 371\u2013397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_13.","DOI":"10.1007\/978-3-030-34618-8_13"},{"key":"1855_CR4","doi-asserted-by":"publisher","unstructured":"Albrecht M.R., Cid C., Grassi L., Rechberger C., Schofnegger M.: Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC. In: Galbraith S.D., Moriai S. (eds.) Advances in Cryptology\u2014ASIACRYPT 2019, Part III. Lecture Notes in Computer Science, vol. 11923, pp. 371\u2013397. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_13.","DOI":"10.1007\/978-3-030-34618-8_13"},{"key":"1855_CR5","doi-asserted-by":"publisher","unstructured":"Albrecht M.R., Grassi L., Perrin L., Rechberger C., Schofnegger M.: Feistel structures for MPC, and more. In: Sako K., Schneider S., Ryan P.Y.A. (eds.) Computer Security\u2014ESORICS 2019, Part II. Lecture Notes in Computer Science, vol. 11736, pp. 151\u2013171. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_8.","DOI":"10.1007\/978-3-030-29962-0_8"},{"key":"1855_CR6","doi-asserted-by":"publisher","unstructured":"Ashur T., Mahzoun M., Toprakhisar D.: Chaghri\u2014a FHE-friendly block cipher. In: Yin H., Stavrou A., Cremers C. (eds.) Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201922, pp. 139\u2013150. ACM Press, New York (2022). https:\/\/doi.org\/10.1145\/3548606.3559364.","DOI":"10.1145\/3548606.3559364"},{"key":"1855_CR7","doi-asserted-by":"publisher","unstructured":"Baign\u00e8res T., Stern J., Vaudenay S.: Linear cryptanalysis of non binary ciphers. In: Adams C., Miri A., Wiener M. (eds.) Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 4876, pp. 184\u2013211. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77360-3_10.","DOI":"10.1007\/978-3-540-77360-3_10"},{"key":"1855_CR8","doi-asserted-by":"publisher","unstructured":"Beierle C., Biryukov A., Santos L., Khovratovich D., Rechberger C., Schofnegger M.: Alzette: a 64-bit ARX-box. In: Proceedings of the 40th Annual International Cryptology Conference (CRYPTO 2020), pp. 419\u2013448. Springer, Santa Barbara (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_15.","DOI":"10.1007\/978-3-030-56880-1_15"},{"issue":"4","key":"1855_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00196733","volume":"7","author":"E Biham","year":"1994","unstructured":"Biham E.: New types of cryptanalytic attacks using related keys. J. Cryptol. 7(4), 229\u2013246 (1994). https:\/\/doi.org\/10.1007\/BF00196733.","journal-title":"J. Cryptol."},{"issue":"1","key":"1855_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00196725","volume":"4","author":"E Biham","year":"1991","unstructured":"Biham E., Shamir A.: Differential cryptanalysis of DES-like cryptosystems. J. Cryptol. 4(1), 3\u201372 (1991). https:\/\/doi.org\/10.1007\/BF00196725.","journal-title":"J. Cryptol."},{"key":"1855_CR11","doi-asserted-by":"publisher","unstructured":"Biham E., Biryukov A., Shamir A.: Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials. In: Stern J. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201999. Lecture Notes in Computer Science, vol. 1592, pp. 12\u201323. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_2.","DOI":"10.1007\/3-540-48910-X_2"},{"key":"1855_CR12","doi-asserted-by":"publisher","unstructured":"Biryukov A., Wagner D.: Slide attacks. In: Fast Software Encryption\u2013FSE\u201999. Lecture Notes in Computer Science, vol. 1636, pp. 245\u2013259. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48155-4_18.","DOI":"10.1007\/3-540-48155-4_18"},{"issue":"3","key":"1855_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10623-012-9697-z","volume":"70","author":"A Bogdanov","year":"2014","unstructured":"Bogdanov A., Rijmen V.: Linear hulls with correlation zero and linear cryptanalysis of block ciphers. Des. Codes Cryptogr. 70(3), 369\u2013383 (2014). https:\/\/doi.org\/10.1007\/s10623-012-9697-z.","journal-title":"Des. Codes Cryptogr."},{"key":"1855_CR14","doi-asserted-by":"publisher","unstructured":"Brakerski, Z.: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. In: Advances in Cryptology\u2013CRYPTO 2012. Lecture Notes in Computer Science, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"1855_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2640327","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z., Gentry C., Vaikuntanathan V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 1\u201336 (2014). https:\/\/doi.org\/10.1145\/2640327.","journal-title":"ACM Trans. Comput. Theory"},{"issue":"3","key":"1855_CR16","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00145-017-9266-1","volume":"31","author":"A Canteaut","year":"2018","unstructured":"Canteaut A., Carpov S., Fontaine C., G\u00fcneysu T., Vercauteren F.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptol. 31(3), 885\u2013916 (2018). https:\/\/doi.org\/10.1007\/s00145-017-9266-1.","journal-title":"J. Cryptol."},{"issue":"2","key":"1855_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1008366319778","volume":"15","author":"C Carlet","year":"1998","unstructured":"Carlet C., Charpin P., Zinoviev V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125\u2013156 (1998). https:\/\/doi.org\/10.1023\/A:1008366319778.","journal-title":"Des. Codes Cryptogr."},{"key":"1855_CR18","doi-asserted-by":"publisher","unstructured":"Cheon J.H., Kim A., Kim M., Song Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Advances in Cryptology\u2014ASIACRYPT 2017. Lecture Notes in Computer Science, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-7908-2948-8_15.","DOI":"10.1007\/978-3-7908-2948-8_15"},{"key":"1855_CR19","doi-asserted-by":"publisher","unstructured":"Chillotti I., Gama N., Georgieva M., Izabachene M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Advances in Cryptology\u2014ASIACRYPT 2016. Lecture Notes in Computer Science, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-7908-2946-5_1.","DOI":"10.1007\/978-3-7908-2946-5_1"},{"key":"1855_CR20","doi-asserted-by":"publisher","unstructured":"Cho J., Ha J., Kim S.K., Lee B.H., Lee J., Lee J., Moon D.J., Yoon H.: Transciphering framework for approximate homomorphic encryption. In: Advances in Cryptology\u2014ASIACRYPT 2021. Lecture Notes in Computer Science, vol. 13092, pp. 640\u2013669. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_22.","DOI":"10.1007\/978-3-030-92078-4_22"},{"key":"1855_CR21","doi-asserted-by":"publisher","unstructured":"Cid C., Indr\u00f8y J.P., Raddum H.: Fasta\u2014a stream cipher for fast FHE evaluation. In: Galbraith S.D. (ed.) Topics in Cryptology\u2014CT-RSA 2022. Lecture Notes in Computer Science, vol. 13161, pp. 451\u2013483. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_19.","DOI":"10.1007\/978-3-030-95312-6_19"},{"key":"1855_CR22","doi-asserted-by":"publisher","unstructured":"Cong K., Das D., Park J., Pereira H.L.: Sortinghat: efficient private decision tree evaluation via homomorphic encryption and transciphering. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201922, pp. 563\u2013577. ACM, New York (2022). https:\/\/doi.org\/10.1145\/3548606.3560702.","DOI":"10.1145\/3548606.3560702"},{"key":"1855_CR23","doi-asserted-by":"publisher","unstructured":"Cosseron O., Hoffmann C., Meaux P., Rivos Set T.: Towards case-optimized hybrid homomorphic encryption\u2014featuring the Elisabeth stream cipher. In: Agrawal S., Lin D. (eds.) Advances in Cryptology\u2014ASIACRYPT 2022, Part III. Lecture Notes in Computer Science, vol. 13793, pp. 32\u201367. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_2.","DOI":"10.1007\/978-3-031-22969-5_2"},{"key":"1855_CR24","doi-asserted-by":"publisher","unstructured":"Courtois N.T., Pieprzyk J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: Zheng Y. (ed.) Advances in Cryptology\u2014ASIACRYPT 2002. Lecture Notes in Computer Science, vol. 2501, pp. 267\u2013287. Springer, Queenstown (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_16.","DOI":"10.1007\/3-540-36178-2_16"},{"key":"1855_CR25","doi-asserted-by":"publisher","unstructured":"Daemen J., Rijmen V.: The Design of Rijndael: AES the Advanced Encryption Standard. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-04722-4.","DOI":"10.1007\/978-3-662-04722-4"},{"key":"1855_CR26","doi-asserted-by":"publisher","unstructured":"De\u00a0Canni\u00e8re C., Preneel B.: Trivium. In: Fast Software Encryption. Lecture Notes in Computer Science, vol. 5086, pp. 244\u2013266. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70500-0_14.","DOI":"10.1007\/978-3-540-70500-0_14"},{"key":"1855_CR27","doi-asserted-by":"publisher","unstructured":"Dinur I., Shamir A.: Cube attacks on tweakable black box polynomials. In: Advances in Cryptology\u2014EUROCRYPT 2009. Lecture Notes in Computer Science, vol. 5479, pp. 278\u2013299. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_15.","DOI":"10.1007\/978-3-642-01001-9_15"},{"key":"1855_CR28","doi-asserted-by":"publisher","unstructured":"Dobraunig C., Eichlseder M., Grassi L., Mendel F., Schaffner C.: Rasta: a cipher with low ANDdepth and few ANDs per bit. In: Advances in Cryptology\u2014CRYPTO 2018. Lecture Notes in Computer Science, vol. 10991, pp. 662\u2013692. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_23.","DOI":"10.1007\/978-3-319-96884-1_23"},{"key":"1855_CR29","doi-asserted-by":"publisher","unstructured":"Dobraunig C., Grassi L., Helminger L., Jajodia S., Mendel F., Schaffner C.: Pasta: a case for hybrid homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(3), 30\u201373 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i3.30-73.","DOI":"10.46586\/tches.v2023.i3.30-73"},{"key":"1855_CR30","doi-asserted-by":"publisher","unstructured":"Fu K., Wang M., Guo Y., Rijmen V., Liu M.: MILP-based automatic search algorithms for differential and linear trails for speck. In: Peyrin T. (ed.) Fast Software Encryption. Lecture Notes in Computer Science, vol. 9783, pp. 268\u2013288. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_14.","DOI":"10.1007\/978-3-662-52993-5_14"},{"key":"1855_CR31","doi-asserted-by":"crossref","unstructured":"Gentry C.: A fully homomorphic encryption scheme (2009). https:\/\/api.semanticscholar.org\/CorpusID:53903759.","DOI":"10.1145\/1536414.1536440"},{"key":"1855_CR32","doi-asserted-by":"publisher","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. STOC \u201909, pp. 169\u2013178. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536440.","DOI":"10.1145\/1536414.1536440"},{"key":"1855_CR33","doi-asserted-by":"publisher","unstructured":"Gentry C., Halevi S., Smart N.P.: Homomorphic evaluation of the AES circuit. In: Advances in Cryptology\u2014CRYPTO 2012. Lecture Notes in Computer Science, vol. 7417, pp. 850\u2013867. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_49.","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"1855_CR34","doi-asserted-by":"publisher","unstructured":"Gentry C., Sahai A., Waters B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology\u2014EUROCRYPT 2013. Lecture Notes in Computer Science, vol. 7881, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_5.","DOI":"10.1007\/978-3-642-38348-9_5"},{"key":"1855_CR35","doi-asserted-by":"crossref","unstructured":"Grassi L., Onofri S., Pedicini M., Sozzi L.: Invertible quadratic non-linear layers for MPC-\/FHE-\/ZK-friendly schemes over $$\\mathbb{F}_{p^n}$$. IACR Trans. Symmetric Cryptol. 2022(3), 20\u201372 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.20-72.","DOI":"10.46586\/tosc.v2022.i3.20-72"},{"key":"1855_CR36","doi-asserted-by":"publisher","first-page":"194741","DOI":"10.1109\/ACCESS.2020.3030344","volume":"8","author":"J Ha","year":"2020","unstructured":"Ha J., Kim S.K., Choi W., Lee B.H., Moon D.J.: Masta: an HE-friendly cipher using modular arithmetic. IEEE Access 8, 194741\u2013194751 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3030344.","journal-title":"IEEE Access"},{"key":"1855_CR37","doi-asserted-by":"publisher","unstructured":"Ha J., Kim S., Lee B., Moon D., Yoon H.: Rubato: Noisy ciphers for approximate homomorphic encryption. In: Dunkelman O., Dziembowski S. (eds.) Advances in Cryptology\u2014EUROCRYPT 2022, Part I. Lecture Notes in Computer Science, vol. 13275, pp. 581\u2013610. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_20.","DOI":"10.1007\/978-3-031-06944-4_20"},{"key":"1855_CR38","unstructured":"Halevi S., Shoup V.: Design and implementation of HElib: a homomorphic encryption library. Technical Report 2020\/1481, IACR Cryptology ePrint Archive (2020). https:\/\/eprint.iacr.org\/2020\/1481."},{"key":"1855_CR39","doi-asserted-by":"publisher","unstructured":"Hebborn P., Leander G.: Dasta\u2014alternative linear layer for RASTA. IACR Trans. Symmetric Cryptol. (2020). https:\/\/doi.org\/10.46586\/tosc.v2020.i3.46-86.","DOI":"10.46586\/tosc.v2020.i3.46-86"},{"issue":"1","key":"1855_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-020-09350-8","volume":"34","author":"C Hoffmann","year":"2021","unstructured":"Hoffmann C., Meaux P., Ricos Set T.: Transciphering, using FiLIP and TFHE for an efficient delegation of computation. J. Cryptol. 34(1), 1\u201330 (2021). https:\/\/doi.org\/10.1007\/s00145-020-09350-8.","journal-title":"J. Cryptol."},{"key":"1855_CR41","doi-asserted-by":"publisher","unstructured":"Jakobsen T., Knudsen L.R.: The interpolation attack on block ciphers. In: Fast Software Encryption (FSE 1997). Lecture Notes in Computer Science, vol. 1267, pp. 28\u201340. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052340.","DOI":"10.1007\/BFb0052340"},{"key":"1855_CR42","doi-asserted-by":"publisher","unstructured":"Joux A., Vitse V.: A crossbred algorithm for solving Boolean polynomial systems. In: New Trends in Cryptography (NuTMiC 2017). Lecture Notes in Computer Science, vol. 10737, pp. 3\u201321. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72254-2_1.","DOI":"10.1007\/978-3-319-72254-2_1"},{"key":"1855_CR43","unstructured":"Kara O.: Reflection Attacks on Product Ciphers. Technical Report 2007\/43, IACR Cryptology ePrint Archive (2007). https:\/\/eprint.iacr.org\/2007\/43."},{"key":"1855_CR44","doi-asserted-by":"publisher","unstructured":"Keller N., Rosemarin A.: Mind the middle layer: the HADES design strategy revisited. In: Canteaut A., Standaert F.-X. (eds.) Advances in Cryptology\u2014EUROCRYPT 2021, Part II. Lecture Notes in Computer Science, vol. 12697, pp. 35\u201363. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_2.","DOI":"10.1007\/978-3-030-77886-6_2"},{"key":"1855_CR45","doi-asserted-by":"publisher","unstructured":"Knudsen L.R.: Truncated and higher order differentials. In: Fast Software Encryption (FSE 1994). Lecture Notes in Computer Science, vol. 1008, pp. 196\u2013211. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-60590-8_16.","DOI":"10.1007\/3-540-60590-8_16"},{"key":"1855_CR46","doi-asserted-by":"publisher","unstructured":"Knudsen L., Wagner D.: Integral cryptanalysis. In: Fast Software Encryption\u2014FSE 2002. Lecture Notes in Computer Science, vol. 2365, pp. 112\u2013127. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45661-9_9.","DOI":"10.1007\/3-540-45661-9_9"},{"key":"1855_CR47","doi-asserted-by":"publisher","unstructured":"Lai X.J.: Higher order derivatives and differential cryptanalysis. In: Advances in Cryptology\u2014EUROCRYPT \u201994. Lecture Notes in Computer Science, vol. 950, pp. 227\u2013233. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_21.","DOI":"10.1007\/3-540-48658-5_21"},{"issue":"5","key":"1855_CR48","doi-asserted-by":"publisher","first-page":"3729","DOI":"10.1109\/TIT.2024.3349414","volume":"70","author":"F Liu","year":"2024","unstructured":"Liu F., Li Y., Chen H., Jiao L., Luo M., Wang M.: Yux: finite field multiplication based block ciphers for efficient FHE evaluation. IEEE Trans. Inf. Theory 70(5), 3729\u20133749 (2024). https:\/\/doi.org\/10.1109\/TIT.2024.3349414.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1855_CR49","doi-asserted-by":"publisher","unstructured":"Matsui M.: Linear cryptanalysis method for DES cipher. In: Helleseth T. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201993. Lecture Notes in Computer Science, vol. 765, pp. 386\u2013397. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_33.","DOI":"10.1007\/3-540-48285-7_33"},{"key":"1855_CR50","doi-asserted-by":"publisher","unstructured":"Matsui M.: New structure of block ciphers with provable security against differential and linear cryptanalysis. In: Gollmann D. (ed.) Fast Software Encryption. Lecture Notes in Computer Science, vol. 1039, pp. 205\u2013218. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60865-6_16.","DOI":"10.1007\/3-540-60865-6_16"},{"key":"1855_CR51","doi-asserted-by":"publisher","unstructured":"M\u00e9aux P., Journault A., Standaert F.-X., et al.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Advances in Cryptology\u2014EUROCRYPT 2016. Lecture Notes in Computer Science, vol. 9665, pp. 15\u201337. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_2.","DOI":"10.1007\/978-3-662-49896-5_2"},{"key":"1855_CR52","doi-asserted-by":"publisher","unstructured":"Mohammad S.R., Kim L., Blake P., Dai W.: Heax: High-performance architecture for computation on homomorphically encrypted data in the cloud. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 1201\u20131218. IEEE, New York (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00070.","DOI":"10.1109\/SP40000.2020.00070"},{"issue":"9","key":"1855_CR53","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2976594","volume":"59","author":"M Naehrig","year":"2016","unstructured":"Naehrig M., Lauter K., Vaikuntanathan V.: Can homomorphic encryption be practical? Commun. ACM 59(9), 56\u201365 (2016). https:\/\/doi.org\/10.1145\/2976594.","journal-title":"Commun. ACM"},{"key":"1855_CR54","doi-asserted-by":"publisher","unstructured":"Niederhagen R., Ning K., Yang B.: Implementing JouxVitse\u2019s crossbred algorithm for solving MQ systems over GF(2) on GPUs. In: Post-Quantum Cryptography (PQCrypto 2018). Lecture Notes in Computer Science, vol. 10786, pp. 121\u2013141. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_7.","DOI":"10.1007\/978-3-319-79063-3_7"},{"key":"1855_CR55","doi-asserted-by":"publisher","unstructured":"Nyberg K.: Differentially uniform mappings for cryptography. In: Helleseth T. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201993. Lecture Notes in Computer Science, vol. 765, pp. 55\u201364. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_6.","DOI":"10.1007\/3-540-48285-7_6"},{"key":"1855_CR56","unstructured":"Rivest R.L., Dertouzos M.L.: On data banks and privacy homomorphisms (1978). https:\/\/api.semanticscholar.org\/CorpusID:6905087."},{"key":"1855_CR57","doi-asserted-by":"publisher","unstructured":"Schneier B., Ferguson N., Whiting D., Hall C., Maurer M., Lucks S., Wagner D., Kelsey J.: The Twofish Encryption Algorithm. In: Bellare M. (ed.) Fast Software Encryption. Lecture Notes in Computer Science, vol. 1978, pp. 33\u201346. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_3.","DOI":"10.1007\/3-540-44598-6_3"},{"key":"1855_CR58","unstructured":"Smart N., Vercauteren F.: Fully homomorphic SIMD operations. Technical Report 2011\/133, IACR Cryptology ePrint Archive (2011). https:\/\/eprint.iacr.org\/2011\/133."},{"key":"1855_CR59","doi-asserted-by":"publisher","unstructured":"Sun B., Liu M., Guo J., Rijmen V., Li R.: Provable security evaluation of structures against impossible differential and zero correlation linear cryptanalysis. In: Fischlin M., Coron J.-S. (eds.) Advances in Cryptology\u2014EUROCRYPT 2016, Part I. Lecture Notes in Computer Science, vol. 9665, pp. 196\u2013213. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_8.","DOI":"10.1007\/978-3-662-49896-5_8"},{"key":"1855_CR60","doi-asserted-by":"publisher","unstructured":"Todo Y.: Structural evaluation by generalized integral property. In: Oswald E., Fischlin M. (eds.) Advances in Cryptology\u2014EUROCRYPT 2015, Part I. Lecture Notes in Computer Science, vol. 9056, pp. 287\u2013314. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10.","DOI":"10.1007\/978-3-662-46803-6_10"},{"key":"1855_CR61","doi-asserted-by":"publisher","unstructured":"van\u00a0Dijk M., Gentry C., Halevi S., Vaikuntanathan V.: Fully homomorphic encryption over the integers. In: Advances in Cryptology\u2014EUROCRYPT 2010. Lecture Notes in Computer Science, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_2.","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"1855_CR62","unstructured":"Vielhaber M.: Breaking One.Fivium by AIDA an Algebraic IV Differential Attack. Technical Report 2007\/413, IACR Cryptology ePrint Archive (2007). https:\/\/eprint.iacr.org\/2007\/413."},{"key":"1855_CR63","doi-asserted-by":"publisher","unstructured":"Wagner D.: The boomerang attack. In: Fast Software Encryption\u2014FSE 1999. Lecture Notes in Computer Science, vol. 1636, pp. 156\u2013170. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48155-4_13.","DOI":"10.1007\/3-540-48155-4_13"},{"key":"1855_CR64","doi-asserted-by":"publisher","unstructured":"Wu B., Kong W., Kong D., Yan H.: MDS diffusion layers for arithmetization-oriented symmetric ciphers: the rotational-add construction. IACR Trans. Symmetric Cryptol. 2025(3), 827\u2013867 (2025) https:\/\/doi.org\/10.46586\/tosc.v2025.i3.827-867.","DOI":"10.46586\/tosc.v2025.i3.827-867"},{"key":"1855_CR65","doi-asserted-by":"publisher","unstructured":"Xiang Z., Zhang W., Bao Z., Lin D.: Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers. In: Cheon J.H., Takagi T. (eds.) Advances in Cryptology\u2014ASIACRYPT 2016, Part I. Lecture Notes in Computer Science, vol. 10031, pp. 648\u2013678. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_24.","DOI":"10.1007\/978-3-662-53887-6_24"},{"key":"1855_CR66","doi-asserted-by":"publisher","unstructured":"Yang G., Zhu B., Suder V., Aagaard M.D., Gong G.: The Simeck family of lightweight block ciphers. In: G\u00fcneysu T., Handschuh H. (eds.) Cryptographic Hardware and Embedded Systems (CHES 2015). Lecture Notes in Computer Science, pp. 307\u2013329. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48324-4_16.","DOI":"10.1007\/978-3-662-48324-4_16"},{"key":"1855_CR67","unstructured":"Zheng J., Ren S., Jing Q., Song R.: Z Cipher scheme. J. Cryptol. Res. 5(6), 579\u2013590 (2018). https:\/\/doi.org\/10.13868\/j.cnki.jcr.000267."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01855-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01855-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01855-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T12:16:20Z","timestamp":1781784980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01855-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,18]]},"references-count":67,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["1855"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01855-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,18]]},"assertion":[{"value":"27 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"140"}}