{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T16:22:10Z","timestamp":1789057330472,"version":"build-2803163510"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the National Key Research and Development Program of China","award":["Grant No.2018YFA0704704"],"award-info":[{"award-number":["Grant No.2018YFA0704704"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["Grant No.62032014"],"award-info":[{"award-number":["Grant No.62032014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>LowMC is a family of block ciphers proposed by Albrecht et al. at EUROCRYPT 2015, which is tailored specifically for FHE and MPC applications. At ToSC 2018, a difference enumeration attack was given for the cryptanalysis of low-data instances of full LowMCv2 with few applied S-boxes per round. Recently at CRYPTO 2021, an efficient algebraic technique was proposed to attack 4-round LowMC adopting a full S-box layer. Following these works, we present a new difference enumeration attack framework, which is based on our new observations on the LowMC S-box, to analyze LowMC instances with a full S-box layer. As a result, with only 3 chosen plaintexts, we can attack 4-round LowMC instances which adopt a full S-box layer with block size of 129, 192, and 255 bits, respectively. We show that all these attacks have either a lower time complexity or a higher success probability than those reported in the CRYPTO paper.<\/jats:p>","DOI":"10.1007\/s10623-022-01178-1","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T08:15:29Z","timestamp":1676621729000},"page":"2057-2075","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["New cryptanalysis of LowMC with algebraic techniques"],"prefix":"10.1007","volume":"91","author":[{"given":"Wenxiao","family":"Qiao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0592-6772","authenticated-orcid":false,"given":"Hailun","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siwei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiwu","family":"Jing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,17]]},"reference":[{"key":"1178_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht M.R., Rechberger C., Schneider T., Tiessen T., Zohner M.: Ciphers for MPC and FHE. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 430\u2013454. Springer (2015)","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"1178_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht M., Grassi L., Rechberger C., Roy A., Tiessen T.: Mimc: Efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: International Conference on the Theory and Application of Cryptology and Information Security. pp. 191\u2013219. Springer (2016)","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"1178_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht M.R., Grassi L., Perrin L., Ramacher S., Rechberger C., Rotaru D., Roy A., Schofnegger M.: Feistel structures for MPC, and more. In: European Symposium on Research in Computer Security. pp. 151\u2013171. Springer (2019)","DOI":"10.1007\/978-3-030-29962-0_8"},{"key":"1178_CR4","doi-asserted-by":"crossref","unstructured":"Banik S., Barooti K., Durak F.B., Vaudenay S.: Cryptanalysis of LowMC instances using single plaintext\/ciphertext pair. IACR Trans. Symmetric Cryptol. pp. 130\u2013146 (2020)","DOI":"10.46586\/tosc.v2020.i4.130-146"},{"key":"1178_CR5","doi-asserted-by":"crossref","unstructured":"Banik S., Barooti K., Vaudenay S., Yan H.: New attacks on LowMC instances with a single plaintext\/ciphertext pair. In: International Conference on the Theory and Application of Cryptology and Information Security. pp. 303\u2013331. Springer (2021)","DOI":"10.1007\/978-3-030-92062-3_11"},{"key":"1178_CR6","unstructured":"Banik S., Barooti K., Caforio A., Vaudenay S.: Memory-efficient single data-complexity attacks on LowMC using partial sets. Cryptology ePrint Archive (2022)"},{"issue":"3","key":"1178_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z., Gentry C., Vaikuntanathan V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014).","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"issue":"3","key":"1178_CR8","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00145-017-9273-9","volume":"31","author":"A Canteaut","year":"2018","unstructured":"Canteaut A., Carpov S., Fontaine C., Lepoint T., Naya-Plasencia M., Paillier P., Sirdey R.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptol. 31(3), 885\u2013916 (2018).","journal-title":"J. Cryptol."},{"key":"1178_CR9","unstructured":"Chase M., Derler D., Goldfeder S., Katz J., Kolesnikov V., Orlandi C., Ramacher S., Rechberger C., Slamanig D., Wang X., et\u00a0al.: The picnic signature scheme (2020). https:\/\/microsoft.github.io\/Picnic\/"},{"key":"1178_CR10","doi-asserted-by":"crossref","unstructured":"Dinur I.: Cryptanalytic applications of the polynomial method for solving multivariate equation systems over gf (2). In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 374\u2013403. Springer (2021)","DOI":"10.1007\/978-3-030-77870-5_14"},{"key":"1178_CR11","doi-asserted-by":"crossref","unstructured":"Dinur I., Liu Y., Meier W., Wang Q.: Optimized interpolation attacks on lowmc. In: International Conference on the Theory and Application of Cryptology and Information Security. pp. 535\u2013560. Springer (2015)","DOI":"10.1007\/978-3-662-48800-3_22"},{"key":"1178_CR12","doi-asserted-by":"crossref","unstructured":"Dobraunig C., Eichlseder M., Mendel F.: Higher-order cryptanalysis of lowmc. In: ICISC 2015. pp. 87\u2013101. Springer (2015)","DOI":"10.1007\/978-3-319-30840-1_6"},{"key":"1178_CR13","doi-asserted-by":"crossref","unstructured":"Dobraunig C., Eichlseder M., Grassi L., Lallemand V., Leander G., List E., Mendel F., Rechberger C.: Rasta: a cipher with low and depth and few ands per bit. In: Annual International Cryptology Conference. pp. 662\u2013692. Springer (2018)","DOI":"10.1007\/978-3-319-96884-1_22"},{"key":"1178_CR14","doi-asserted-by":"crossref","unstructured":"Dobraunig C., Grassi L., Guinet A., Kuijsters D.: Ciminion: symmetric encryption based on toffoli-gates over large finite fields. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 3\u201334. Springer (2021)","DOI":"10.1007\/978-3-030-77886-6_1"},{"key":"1178_CR15","doi-asserted-by":"crossref","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on Theory of computing. pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"1178_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich O., Micali S., Wigderson A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 307\u2013328 (2019)","DOI":"10.1145\/3335741.3335755"},{"key":"1178_CR17","doi-asserted-by":"crossref","unstructured":"Kales D., Zaverucha G.: Improving the performance of the picnic signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems pp. 154\u2013188 (2020)","DOI":"10.46586\/tches.v2020.i4.154-188"},{"key":"1178_CR18","doi-asserted-by":"crossref","unstructured":"Kolesnikov V., Schneider T.: Improved garbled circuit: Free xor gates and applications. In: International Colloquium on Automata, Languages, and Programming. pp. 486\u2013498. Springer (2008)","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"1178_CR19","doi-asserted-by":"crossref","unstructured":"Liu F., Isobe T., Meier W.: Cryptanalysis of full lowmc and lowmc-m with algebraic techniques. In: Annual International Cryptology Conference. pp. 368\u2013401. Springer (2021)","DOI":"10.1007\/978-3-030-84252-9_13"},{"key":"1178_CR20","doi-asserted-by":"crossref","unstructured":"Liu F., Isobe T., Meier W.: Low-memory algebraic attacks on round-reduced LowMC. Cryptology ePrint Archive (2021)","DOI":"10.1007\/978-3-030-90567-5_5"},{"key":"1178_CR21","doi-asserted-by":"crossref","unstructured":"Liu F., Meier W., Sarkar S., Isobe T.: New low-memory algebraic attacks on lowmc in the picnic setting. IACR Trans. Symmetr. Cryptol. pp. 102\u2013122 (2022)","DOI":"10.46586\/tosc.v2022.i3.102-122"},{"key":"1178_CR22","doi-asserted-by":"crossref","unstructured":"Liu F., Sarkar S., Wang G., Meier W., Isobe T.: Algebraic meet-in-the-middle attack on lowmc. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-22963-3_8"},{"key":"1178_CR23","doi-asserted-by":"crossref","unstructured":"M\u00e9aux P., Journault A., Standaert F.X., Carlet C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 311\u2013343. Springer (2016)","DOI":"10.1007\/978-3-662-49890-3_13"},{"key":"1178_CR24","doi-asserted-by":"crossref","unstructured":"Nielsen J.B., Nordholt P.S., Orlandi C., Burra S.S.: A new approach to practical active-secure two-party computation. In: Annual Cryptology Conference. pp. 681\u2013700. Springer (2012)","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"1178_CR25","unstructured":"Nist\u2019s post-quantum cryptography competition, https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography"},{"key":"1178_CR26","doi-asserted-by":"crossref","unstructured":"Peyrin T., Wang H.: The malicious framework: embedding backdoors into tweakable block ciphers. In: Annual International Cryptology Conference. pp. 249\u2013278. Springer (2020)","DOI":"10.1007\/978-3-030-56877-1_9"},{"key":"1178_CR27","doi-asserted-by":"crossref","unstructured":"Rechberger C., Soleimany H., Tiessen T.: Cryptanalysis of low-data instances of full lowmcv2. IACR Transactions on Symmetric Cryptology pp. 163\u2013181 (2018)","DOI":"10.46586\/tosc.v2018.i3.163-181"},{"key":"1178_CR28","doi-asserted-by":"crossref","unstructured":"Tiessen T.: Polytopic cryptanalysis. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 214\u2013239. Springer (2016)","DOI":"10.1007\/978-3-662-49890-3_9"},{"key":"1178_CR29","doi-asserted-by":"crossref","unstructured":"Yao A.C.: Protocols for secure computations. In: 23rd annual symposium on foundations of computer science (SFCS 1982). pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"1178_CR30","doi-asserted-by":"crossref","unstructured":"Yao A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986). pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"1178_CR31","unstructured":"Grassi L., Kales D., Rechberger C., Schofnegger M.: Survey of key-recovery attacks on lowmc in a single plaintext\/ciphertext scenario (2020)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01178-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01178-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01178-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:09:39Z","timestamp":1682021379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01178-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,17]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1178"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01178-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,17]]},"assertion":[{"value":"4 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}