{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T06:22:06Z","timestamp":1774851726109,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T00:00:00Z","timestamp":1771891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T00:00:00Z","timestamp":1771891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018769","name":"Nankai Zhide Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100018769","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2022YFA1005000"],"award-info":[{"award-number":["2022YFA1005000"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12141108, 62371259"],"award-info":[{"award-number":["12141108, 62371259"]}],"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":[[2026,3]]},"DOI":"10.1007\/s10623-026-01809-x","type":"journal-article","created":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T04:04:08Z","timestamp":1771905848000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning with errors over group rings constructed by semi-direct product"],"prefix":"10.1007","volume":"94","author":[{"given":"Jiaqi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,24]]},"reference":[{"key":"1809_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S., Boneh D., Boyen X.: Efficient lattice (H)IBE in the standard model. In: Advances in Cryptology\u2013EUROCRYPT, pp. 553\u2013572 (2010).","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"1809_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal S., Freeman D.M., Vaikuntanathan V.: Functional encryption for inner product predicates from learning with errors. In: Advances in Cryptology\u2013ASIACRYPT, pp. 21\u201340 (2011).","DOI":"10.1007\/978-3-642-25385-0_2"},{"key":"1809_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai M.: Generating hard instances of lattice problems. In: Proceedings of 28th Annual ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996).","DOI":"10.1145\/237814.237838"},{"key":"1809_CR4","doi-asserted-by":"crossref","unstructured":"Albrecht M.R., Deo A.: Large modulus ring-LWE $$\\ge $$ module-LWE. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 267\u2013296 (2017).","DOI":"10.1007\/978-3-319-70694-8_10"},{"key":"1809_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum B., Cash D., Peikert C., Sahai A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Advances in Cryptology-CRYPTO, pp. 595\u2013618 (2009).","DOI":"10.1007\/978-3-642-03356-8_35"},{"issue":"1","key":"1809_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986).","journal-title":"Combinatorica"},{"issue":"4","key":"1809_CR7","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296(4), 625\u2013635 (1993).","journal-title":"Math. Ann."},{"key":"1809_CR8","doi-asserted-by":"crossref","unstructured":"Banerjee A., Peikert C.: New and improved key-homomorphic pseudorandom functions. In: Advances in Cryptology\u2013CRYPTO, pp. 353\u2013370 (2014).","DOI":"10.1007\/978-3-662-44371-2_20"},{"key":"1809_CR9","doi-asserted-by":"crossref","unstructured":"Biasse J., Song F.: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In: SODA\u201916, pp. 893\u2013902 (2016).","DOI":"10.1137\/1.9781611974331.ch64"},{"key":"1809_CR10","doi-asserted-by":"crossref","unstructured":"Bolboceanu M., Brakerski Z., Perlman R., Sharma D.: Order-LWE and the hardness of ring-LWE with entropic secrets. In: Advances in Cryptology\u2013ASIACRYPT, pp. 91\u2013120 (2019).","DOI":"10.1007\/978-3-030-34621-8_4"},{"key":"1809_CR11","doi-asserted-by":"crossref","unstructured":"Boneh D., Gentry C., Gorbunov S., Halevi S., Nikolaenko V., Segev G., Vaikuntanathan V., Vinayagamurthy D.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Advances in Cryptology\u2013EUROCRYPT, pp. 533\u2013556 (2014).","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"1809_CR12","doi-asserted-by":"crossref","unstructured":"Boneh D., Lewi K., Montgomery H.W., Raghunathan A.: Key homomorphic PRFs and their applications. In: Advances in Cryptology\u2013CRYPTO, pp. 410\u2013428 (2013).","DOI":"10.1007\/978-3-642-40041-4_23"},{"issue":"3","key":"1809_CR13","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":"2","key":"1809_CR14","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z., Vaikuntanathan V.: Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput. 43(2), 831\u2013871 (2014).","journal-title":"SIAM J. Comput."},{"key":"1809_CR15","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-011-9105-2","volume":"25","author":"D Cash","year":"2012","unstructured":"Cash D., Hofheinz D., Kiltz E., Peikert C.: Bonsai trees, or how to delegate a lattice basis. J. Cryptol. 25, 601\u2013639 (2012).","journal-title":"J. Cryptol."},{"issue":"1","key":"1809_CR16","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1137\/16M1096566","volume":"1","author":"H Chen","year":"2017","unstructured":"Chen H., Lauter K., Stange K.E.: Attacks on the search RLWE problem with small errors. SIAM J. Appl. Algebra Geom. 1(1), 665\u2013682 (2017).","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"1","key":"1809_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-021-00973-6","volume":"90","author":"Q Cheng","year":"2022","unstructured":"Cheng Q., Zhang J., Zhuang J.: LWE from non-commutative group rings. Des. Codes Cryptogr. 90(1), 239\u2013263 (2022).","journal-title":"Des. Codes Cryptogr."},{"key":"1809_CR18","doi-asserted-by":"crossref","unstructured":"Cramer R., Ducas L., Peikert C., Regev O.: Recovering short generators of principal ideals in cyclotomic rings. In: Advances in Cryptology\u2013EUROCRYPT, pp. 559\u2013585 (2016).","DOI":"10.1007\/978-3-662-49896-5_20"},{"key":"1809_CR19","doi-asserted-by":"crossref","unstructured":"Cramer R., Ducas L., Wesolowski B.: Short stickelberger class relations and application to ideal-svp. In: Advances in Cryptology\u2013EUROCRYPT, pp. 324\u2013348 (2017).","DOI":"10.1007\/978-3-319-56620-7_12"},{"issue":"6","key":"1809_CR20","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W., Hellman M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1809_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1809_CR22","doi-asserted-by":"crossref","unstructured":"Elias Y., Lauter K.E., Ozman E., Stange K.E.: Provably weak instances of Ring-LWE. In: Advances in Cryptology\u2013CRYPTO, pp. 63\u201392 (2015).","DOI":"10.1007\/978-3-662-47989-6_4"},{"key":"1809_CR23","unstructured":"Endelman R., Mukherjee M.: Primitive central idempotents of the group algebra. arXiv:0803.1336 (2008)."},{"key":"1809_CR24","doi-asserted-by":"crossref","unstructured":"Garg S., Gentry C., Halevi S.: Candidate multilinear maps from ideal lattices. In: Advances in Cryptology\u2013EUROCRYPT, pp. 1\u201317 (2013).","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"1809_CR25","doi-asserted-by":"crossref","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009).","DOI":"10.1145\/1536414.1536440"},{"key":"1809_CR26","doi-asserted-by":"crossref","unstructured":"Gentry C., Gorbunov S., Halevi S.: Graph-induced multilinear maps from lattices. In: Theory of Cryptography Conference (TCC), pp. 498\u2013527 (2015).","DOI":"10.1007\/978-3-662-46497-7_20"},{"key":"1809_CR27","doi-asserted-by":"crossref","unstructured":"Gentry C., Peikert C., Vaikuntanathan V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of 41st Annual ACM Symposium on Theory of Computing, pp. 197\u2013206 (2008).","DOI":"10.1145\/1374376.1374407"},{"key":"1809_CR28","doi-asserted-by":"crossref","unstructured":"Gentry C., Sahai A., Waters B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology\u2013CRYPTO, pp. 75\u201392 (2013).","DOI":"10.1007\/978-3-642-40041-4_5"},{"issue":"6","key":"1809_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2824233","volume":"62","author":"S Gorbunov","year":"2015","unstructured":"Gorbunov S., Vaikuntanathan V., Wee H.: Attribute-based encryption for circuits. J. ACM 62(6), 1\u201333 (2015).","journal-title":"J. ACM"},{"key":"1809_CR30","doi-asserted-by":"crossref","unstructured":"Gorbunov S., Vaikuntanathan V., Wee H.: Predicate encryption for circuits from LWE. In: Advances in Cryptology\u2013CRYPTO, pp. 503\u2013523 (2015).","DOI":"10.1007\/978-3-662-48000-7_25"},{"issue":"22","key":"1809_CR31","first-page":"1","volume":"35","author":"C Grover","year":"2022","unstructured":"Grover C., Mendelsohn A., Ling C., Vehkalahti R.: Non-commutative ring learning with errors from cyclic algebras. J. Cryptol. 35(22), 1\u201367 (2022).","journal-title":"J. Cryptol."},{"key":"1809_CR32","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: NTRU: A ring-based public key cryptosystem. In: Proceedings of 3rd International Symposium on ANTS, pp.\u00a0267\u2013288 (1998).","DOI":"10.1007\/BFb0054868"},{"issue":"3","key":"1809_CR33","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois A., Stehl\u00e9 D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3), 565\u2013599 (2015).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1809_CR34","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W. Jr., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"1809_CR35","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V., Peikert C., Regev O.: On ideal lattices and learning with errors over rings. In: Advances in Cryptology\u2013EUROCRYPT, pp. 1\u201323 (2010).","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"1809_CR36","doi-asserted-by":"crossref","unstructured":"Mendelsohn A., Ling C.: On the Security of group ring learning with errors. In: IACR Communications in Cryptology, 2(2), (2025).","DOI":"10.62056\/ahey76bm"},{"key":"1809_CR37","doi-asserted-by":"crossref","unstructured":"Micciancio D., Peikert C.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Advances in Cryptology\u2013EUROCRYPT, pp. 700\u2013718 (2012).","DOI":"10.1007\/978-3-642-29011-4_41"},{"issue":"1","key":"1809_CR38","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio D., Regev O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007).","journal-title":"SIAM J. Comput."},{"key":"1809_CR39","doi-asserted-by":"crossref","unstructured":"Pan Y., Xu J., Wadleigh N., Cheng Q.: On the ideal shortest vector problem over random rational primes. In: Advances in Cryptology\u2013EUROCRYPT, pp. 559\u2013583 (2021).","DOI":"10.1007\/978-3-030-77870-5_20"},{"key":"1809_CR40","doi-asserted-by":"crossref","unstructured":"Pedrouzo-Ulloa A., Troncoso-Pastoriza J.R., P\u00e9rez-Gonz\u00e1lez F.: Multivariate lattices for encrypted image processing. In: IEEE International Conference on Acoustic Speech Signal Processing (ICASSP), pp. 1707\u20131711 (2015).","DOI":"10.1109\/ICASSP.2015.7178262"},{"key":"1809_CR41","doi-asserted-by":"crossref","unstructured":"Peikert C.: Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of 41st Annual ACM Symposium on Theory of Computing, pp. 333\u2013342 (2009).","DOI":"10.1145\/1536414.1536461"},{"key":"1809_CR42","doi-asserted-by":"crossref","unstructured":"Peikert C., Pepin Z.: Algebraically structured LWE, revisited. In: Theory of Cryptography Conference (TCC), pp. 1\u201323 (2019).","DOI":"10.1007\/978-3-030-36030-6_1"},{"key":"1809_CR43","doi-asserted-by":"crossref","unstructured":"Peikert C., Regev O., Stephens-Davidowitz N.: Pseudorandomness of Ring-LWE for any ring and modulus. In: Proceedings of 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 461\u2013473 (2017).","DOI":"10.1145\/3055399.3055489"},{"key":"1809_CR44","doi-asserted-by":"crossref","unstructured":"Peikert C., Vaikuntanathan V., Waters B.: A framework for efficient and composable oblivious transfer. In: Advances in Cryptology\u2013CRYPTO, pp. 554\u2013571 (2008).","DOI":"10.1007\/978-3-540-85174-5_31"},{"issue":"6","key":"1809_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009).","journal-title":"J. ACM"},{"key":"1809_CR46","doi-asserted-by":"crossref","unstructured":"Ro\u015fca M., Sakzad A., Stehl\u00e9 D., Steinfeld R.: Middle-product learning with errors. In: Advances in Cryptology\u2013CRYPTO, pp. 283\u2013297 (2017).","DOI":"10.1007\/978-3-319-63697-9_10"},{"key":"1809_CR47","doi-asserted-by":"crossref","unstructured":"Rosca M., Stehl\u00e9 D., Wallet A.: On the ring-LWE and polynomial-LWE problems. In: Advances in Cryptology\u2013EUROCRYPT, pp. 146\u2013173 (2018).","DOI":"10.1007\/978-3-319-78381-9_6"},{"key":"1809_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9458-7","volume-title":"Linear Representations of Finite Groups","author":"JP Serre","year":"1977","unstructured":"Serre J.P.: Linear Representations of Finite Groups. Springer, New York (1977)."},{"issue":"5","key":"1809_CR49","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."},{"key":"1809_CR50","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9 D., Steinfeld R., Tanaka K., Xagawa K.: Efficient public key encryption based on ideal lattices. In: Advances in Cryptology\u2013ASIACRYPT, pp. 617\u2013635 (2009).","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"1809_CR51","unstructured":"Yasuda T., Dahan X., Sakurai K.: Characterizing NTRU-variants using group ring and evaluating their lattice security. Cryptology ePrint Archive, Report 2015\/1170 (2015). https:\/\/eprint.iacr.org\/2015\/1170."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01809-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01809-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01809-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T05:02:19Z","timestamp":1774846939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01809-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,24]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1809"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01809-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,24]]},"assertion":[{"value":"7 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 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"}}],"article-number":"61"}}