{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T05:00:58Z","timestamp":1764997258128,"version":"3.46.0"},"reference-count":51,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004497","name":"Onderzoeksraad, KU Leuven","doi-asserted-by":"publisher","award":["C14\/18\/067","STG\/17\/019"],"award-info":[{"award-number":["C14\/18\/067","STG\/17\/019"]}],"id":[{"id":"10.13039\/501100004497","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7,21]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We introduce a general framework encompassing the main hard problems emerging in lattice-based cryptography, which naturally includes the recently proposed Mersenne prime cryptosystem, but also problems coming from code-based cryptography. The framework allows to easily instantiate new hard problems and to automatically construct plausibly post-quantum secure primitives from them. As a first basic application, we introduce two new hard problems and the corresponding encryption schemes. Concretely, we study generalisations of hard problems such as SIS, LWE and NTRU to free modules over quotients of \u2124[\n                    <jats:italic>X<\/jats:italic>\n                    ] by ideals of the form (\n                    <jats:italic>f<\/jats:italic>\n                    ,\n                    <jats:italic>g<\/jats:italic>\n                    ), where\n                    <jats:italic>f<\/jats:italic>\n                    is a monic polynomial and\n                    <jats:italic>g<\/jats:italic>\n                    \u2208 \u2124[\n                    <jats:italic>X<\/jats:italic>\n                    ] is a ciphertext modulus coprime to\n                    <jats:italic>f<\/jats:italic>\n                    . For trivial modules (i.e. of rank one), the case\n                    <jats:italic>f<\/jats:italic>\n                    =\n                    <jats:italic>\n                      X\n                      <jats:sup>n<\/jats:sup>\n                    <\/jats:italic>\n                    + 1 and\n                    <jats:italic>g<\/jats:italic>\n                    =\n                    <jats:italic>q<\/jats:italic>\n                    \u2208 \u2124\n                    <jats:sub>&gt;1<\/jats:sub>\n                    corresponds to ring-LWE, ring-SIS and NTRU, while the choices\n                    <jats:italic>f<\/jats:italic>\n                    =\n                    <jats:italic>\n                      X\n                      <jats:sup>n<\/jats:sup>\n                    <\/jats:italic>\n                    \u2013 1 and\n                    <jats:italic>g<\/jats:italic>\n                    =\n                    <jats:italic>X<\/jats:italic>\n                    \u2013 2 essentially cover the recently proposed Mersenne prime cryptosystems. At the other extreme, when considering modules of large rank and letting deg(\n                    <jats:italic>f<\/jats:italic>\n                    ) = 1, one recovers the framework of LWE and SIS.\n                  <\/jats:p>","DOI":"10.1515\/jmc-2019-0032","type":"journal-article","created":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T04:06:11Z","timestamp":1573185971000},"page":"202-217","source":"Crossref","is-referenced-by-count":4,"title":["A framework for cryptographic problems from linear algebra"],"prefix":"10.1515","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8390-3410","authenticated-orcid":false,"given":"Carl","family":"Bootland","sequence":"first","affiliation":[{"name":"ESAT\/COSIC, KU Leuven , Kasteelpark Arenberg 10, 3000 Leuven , Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0191-5216","authenticated-orcid":false,"given":"Wouter","family":"Castryck","sequence":"additional","affiliation":[{"name":"Department of Mathematics, KU Leuven , Celestijnenlaan 200B, 3000 Leuven , Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Szepieniec","sequence":"additional","affiliation":[{"name":"ESAT\/COSIC, KU Leuven , Kasteelpark Arenberg 10, 3000 Leuven , Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7208-9599","authenticated-orcid":false,"given":"Frederik","family":"Vercauteren","sequence":"additional","affiliation":[{"name":"ESAT\/COSIC, KU Leuven , Kasteelpark Arenberg 10, 3000 Leuven , Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2020,7,21]]},"reference":[{"key":"2025120600172429486_j_jmc-2019-0032_ref_001_w2aab3b7e2148b1b6b1ab2b1b1Aa","unstructured":"D. Aggarwal, A. Joux, A. Prakash and M. Santha, A new public-key cryptosystem via Mersenne numbers, Cryptology ePrint Archive (2017), https:\/\/eprint.iacr.org\/2017\/481\/20170530:072202."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_002_w2aab3b7e2148b1b6b1ab2b1b2Aa","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, A. Joux, A. Prakash and M. Santha, A new public-key cryptosystem via Mersenne numbers, Advances in Cryptology\u2014CRYPTO 2018. Part III, Lecture Notes in Comput. Sci. 10993, Springer, Cham, (2018), 459\u2013482.","DOI":"10.1007\/978-3-319-96878-0_16"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_003_w2aab3b7e2148b1b6b1ab2b1b3Aa","doi-asserted-by":"crossref","unstructured":"M. Ajtai, Generating hard instances of lattice problems (extended abstract), Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, ACM, New York (1996), 99\u2013108.","DOI":"10.1145\/237814.237838"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_004_w2aab3b7e2148b1b6b1ab2b1b4Aa","doi-asserted-by":"crossref","unstructured":"S. Akleylek, N. Bindel, J. Buchmann, J. Kr\u00e4mer and G. A. Marson, An efficient lattice-based signature scheme with provably secure instantiation, Progress in Cryptology\u2014AFRICACRYPT 2016, Lecture Notes in Comput. Sci. 9646, Springer, Cham (2016), 44\u201360.","DOI":"10.1007\/978-3-319-31517-1_3"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_005_w2aab3b7e2148b1b6b1ab2b1b5Aa","doi-asserted-by":"crossref","unstructured":"N. Alamati, H. Montgomery, S. Patranabis and A. Roy, Minicrypt primitives with algebraic structure and applications, Advances in Cryptology\u2014EUROCRYPT 2019, Springer, Cham (2019), 55\u201382.","DOI":"10.1007\/978-3-030-17656-3_3"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_006_w2aab3b7e2148b1b6b1ab2b1b6Aa","doi-asserted-by":"crossref","unstructured":"M. Albrecht, S. Bai and L. Ducas, A subfield lattice attack on overstretched NTRU assumptions: cryptanalysis of some FHE and graded encoding schemes, Advances in Cryptology\u2014CRYPTO 2016. Part I, Lecture Notes in Comput. Sci. 9814, Springer, Berlin (2016), 153\u2013178.","DOI":"10.1007\/978-3-662-53018-4_6"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_007_w2aab3b7e2148b1b6b1ab2b1b7Aa","unstructured":"E. Alkim, L. Ducas, T. P\u00f6ppelmann and P. Schwabe, Post-quantum key exchange\u2014a new hope, Proceedings of the 25th USENIX Security Symposium, USENIX, Berkeley (2016), 327\u2013343."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_008_w2aab3b7e2148b1b6b1ab2b1b8Aa","doi-asserted-by":"crossref","unstructured":"D. J. Bernstein, C. Chuengsatiansup, T. Lange and C. van Vredendaal, NTRU prime: Reducing attack surface at low cost, Selected Areas in Cryptography\u2014SAC 2017, Lecture Notes in Comput. Sci. 10719, Springer, Cham (2018), 235\u2013260.","DOI":"10.1007\/978-3-319-72565-9_12"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_009_w2aab3b7e2148b1b6b1ab2b1b9Aa","doi-asserted-by":"crossref","unstructured":"M. Beunardeau, A. Connolly, R. G\u00e9raud and D. Naccache, On the hardness of the Mersenne low hamming ratio assumption, Progress in Cryptology\u2014LATINCRYPT 2017, Lecture Notes in Comput. Sci. 11368, Springer, Cham (2019), 166\u2013174.","DOI":"10.1007\/978-3-030-25283-0_9"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_010_w2aab3b7e2148b1b6b1ab2b1c10Aa","unstructured":"C. Bootland, W. Castryck, I. Iliashenko and F. Vercauteren, Efficiently processing complex-valued data in homomorphic encryption, Cryptology ePrint Archive (2018), https:\/\/eprint.iacr.org\/2018\/785."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_011_w2aab3b7e2148b1b6b1ab2b1c11Aa","doi-asserted-by":"crossref","unstructured":"J. W. Bos, C. Costello, L. Ducas, I. Mironov, M. Naehrig, V. Nikolaenko, A. Raghunathan and D. Stebila, Frodo: Take off the ring! Practical, quantum-secure key exchange from LWE, Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, ACM, New York (2016), 1006\u20131018.","DOI":"10.1145\/2976749.2978425"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_012_w2aab3b7e2148b1b6b1ab2b1c12Aa","doi-asserted-by":"crossref","unstructured":"Z. Brakerski and N. D\u00f6ttling, Two-message statistically sender-private OT from LWE, Theory of Cryptography. Part II, Lecture Notes in Comput. Sci. 11240, Springer, Cham (2018), 370\u2013390.","DOI":"10.1007\/978-3-030-03810-6_14"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_013_w2aab3b7e2148b1b6b1ab2b1c13Aa","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, C. Gentry and V. Vaikuntanathan, (Leveled) fully homomorphic encryption without bootstrapping, ACM Trans. Comput. Theory 6 (2014), no. 3, Article ID 13.","DOI":"10.1145\/2633600"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_014_w2aab3b7e2148b1b6b1ab2b1c14Aa","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, A. Langlois, C. Peikert, O. Regev and D. Stehl\u00e9, Classical hardness of learning with errors (extended abstract), Proceedings of the 2013 ACM Symposium on Theory of Computing\u2014STOC\u201913, ACM, New York (2013), 575\u2013584.","DOI":"10.1145\/2488608.2488680"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_015_w2aab3b7e2148b1b6b1ab2b1c15Aa","doi-asserted-by":"crossref","unstructured":"W. Castryck, I. Iliashenko and F. Vercauteren, On error distributions in ring-based LWE, LMS J. Comput. Math. 19 (2016), 130\u2013145.","DOI":"10.1112\/S1461157016000280"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_016_w2aab3b7e2148b1b6b1ab2b1c16Aa","doi-asserted-by":"crossref","unstructured":"H. Chen, K. Laine, R. Player and Y. Xia, High-precision arithmetic in homomorphic encryption, Topics in Cryptology\u2014CT-RSA 2018, Lecture Notes in Comput. Sci. 10808, Springer, Cham (2018), 116\u2013136.","DOI":"10.1007\/978-3-319-76953-0_7"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_017_w2aab3b7e2148b1b6b1ab2b1c17Aa","doi-asserted-by":"crossref","unstructured":"J. H. Cheon, J. Jeong and C. Lee, An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero, LMS J. Comput. Math. 19 (2016), 255\u2013266.","DOI":"10.1112\/S1461157016000371"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_018_w2aab3b7e2148b1b6b1ab2b1c18Aa","doi-asserted-by":"crossref","unstructured":"M. Coglianese and B.-M. Goi, MaTRU: A new NTRU-based cryptosystem, Progress in Cryptology\u2014INDOCRYPT 2005, Lecture Notes in Comput. Sci. 3797, Springer, Berlin (2005), 232\u2013243.","DOI":"10.1007\/11596219_19"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_019_w2aab3b7e2148b1b6b1ab2b1c19Aa","unstructured":"J. Ding, X. Xie and X. Lin, A simple provably secure key exchange scheme based on the learning with errors problem, Cryptology ePrint Archive (2012), https:\/\/eprint.iacr.org\/2012\/688."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_020_w2aab3b7e2148b1b6b1ab2b1c20Aa","doi-asserted-by":"crossref","unstructured":"L. Ducas, V. Lyubashevsky and T. Prest, Efficient identity-based encryption over NTRU lattices, Advances in Cryptology\u2014ASIACRYPT 2014. Part II, Lecture Notes in Comput. Sci. 8874, Springer, Heidelberg (2014), 22\u201341.","DOI":"10.1007\/978-3-662-45608-8_2"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_021_w2aab3b7e2148b1b6b1ab2b1c21Aa","unstructured":"J. Fan and F. Vercauteren, Somewhat practical fully homomorphic encryption, Cryptology ePrint Archive (2012), https:\/\/eprint.iacr.org\/2012\/144."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_022_w2aab3b7e2148b1b6b1ab2b1c22Aa","doi-asserted-by":"crossref","unstructured":"C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 2009 ACM International Symposium on Theory of Computing\u2014STOC\u201909, ACM, New York (2009), 169\u2013178.","DOI":"10.1145\/1536414.1536440"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_023_w2aab3b7e2148b1b6b1ab2b1c23Aa","doi-asserted-by":"crossref","unstructured":"C. Gentry, C. Peikert and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions [extended abstract], Proceedings of the 40th Annual ACM Symposium on Theory of Computing\u2014STOC\u201908, ACM, New York (2008), 197\u2013206.","DOI":"10.1145\/1374376.1374407"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_024_w2aab3b7e2148b1b6b1ab2b1c24Aa","unstructured":"C. Gu, Integer version of ring-LWE and its applications, Cryptology ePrint Archive (2017), https:\/\/eprint.iacr.org\/2017\/641."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_025_w2aab3b7e2148b1b6b1ab2b1c25Aa","unstructured":"M. Hamburg, Post-quantum cryptography proposal: ThreeBears, 2018."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_026_w2aab3b7e2148b1b6b1ab2b1c26Aa","unstructured":"J. Hoffstein, J. Pipher and J. H. Silverman, NTRU: A new high speed public key cryptosystem, (1996), https:\/\/web.securityinnovation.com\/hubfs\/files\/ntru-orig.pdf."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_027_w2aab3b7e2148b1b6b1ab2b1c27Aa","doi-asserted-by":"crossref","unstructured":"J. Hoffstein, J. Pipher and J. H. Silverman, NTRU: A ring-based public key cryptosystem, Algorithmic Number Theory, Lecture Notes in Comput. Sci. 1423, Springer, Berlin (1998), 267\u2013288.","DOI":"10.1007\/BFb0054868"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_028_w2aab3b7e2148b1b6b1ab2b1c28Aa","unstructured":"J. Hoffstein, J. Pipher, W. Whyte and Z. Zhang, A signature scheme from learning with truncation, Cryptology ePrint Archive (2017), https:\/\/eprint.iacr.org\/2017\/995."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_029_w2aab3b7e2148b1b6b1ab2b1c29Aa","doi-asserted-by":"crossref","unstructured":"P. Kirchner and P.-A. Fouque, Revisiting lattice attacks on overstretched NTRU parameters, Advances in Cryptology\u2014EUROCRYPT 2017. Part I, Lecture Notes in Comput. Sci. 10210, Springer, Cham (2017), 3\u201326.","DOI":"10.1007\/978-3-319-56620-7_1"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_030_w2aab3b7e2148b1b6b1ab2b1c30Aa","doi-asserted-by":"crossref","unstructured":"A. Langlois and D. Stehl\u00e9, Worst-case to average-case reductions for module lattices, Des. Codes Cryptogr. 75 (2015), no. 3, 565\u2013599.","DOI":"10.1007\/s10623-014-9938-4"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_031_w2aab3b7e2148b1b6b1ab2b1c31Aa","doi-asserted-by":"crossref","unstructured":"S. Ling, K. Nguyen, D. Stehl\u00e9 and H. Wang, Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications, Public-key Cryptography\u2014PKC 2013, Lecture Notes in Comput. Sci. 7778, Springer, Heidelberg (2013), 107\u2013124.","DOI":"10.1007\/978-3-642-36362-7_8"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_032_w2aab3b7e2148b1b6b1ab2b1c32Aa","doi-asserted-by":"crossref","unstructured":"A. L\u00f3pez-Alt, E. Tromer and V. Vaikuntanathan, On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption, Proceedings of the 2012 ACM Symposium on Theory of Computing\u2014STOC\u201912, ACM, New York (2012), 1219\u20131234.","DOI":"10.1145\/2213977.2214086"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_033_w2aab3b7e2148b1b6b1ab2b1c33Aa","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, Lattice signatures without trapdoors, Advances in Cryptology\u2014EUROCRYPT 2012, Lecture Notes in Comput. Sci. 7237, Springer, Heidelberg (2012), 738\u2013755.","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_034_w2aab3b7e2148b1b6b1ab2b1c34Aa","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky and D. Micciancio, Generalized compact knapsacks are collision resistant, Automata, Languages and Programming. Part II, Lecture Notes in Comput. Sci. 4052, Springer, Berlin, (2006), 144\u2013155.","DOI":"10.1007\/11787006_13"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_035_w2aab3b7e2148b1b6b1ab2b1c35Aa","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, C. Peikert and O. Regev, On ideal lattices and learning with errors over rings, Advances in Cryptology\u2014EUROCRYPT 2010, Lecture Notes in Comput. Sci. 6110, Springer, Berlin (2010), 1\u201323.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_036_w2aab3b7e2148b1b6b1ab2b1c36Aa","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, C. Peikert and O. Regev, On ideal lattices and learning with errors over rings, Advances in Cryptology\u2014EUROCRYPT 2010, Lecture Notes in Comput. Sci. 6110, Springer, Berlin (2010), 1\u201323.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_037_w2aab3b7e2148b1b6b1ab2b1c37Aa","unstructured":"R. J. McEliece, A public-key cryptosystem based on algebraic coding theory, JPL DSN Progress Report 42\u201344 (1978), 114\u2013116."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_038_w2aab3b7e2148b1b6b1ab2b1c38Aa","doi-asserted-by":"crossref","unstructured":"B. Mi, D. Huang, S. Wan, L. Mi and J. Cao, Oblivious transfer based on NTRUEncrypt, IEEE Access 6 (2018), 35283\u201335291.","DOI":"10.1109\/ACCESS.2018.2846798"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_039_w2aab3b7e2148b1b6b1ab2b1c39Aa","doi-asserted-by":"crossref","unstructured":"D. Micciancio, Generalized compact knapsacks, cyclic lattices, and efficient one-way functions, Comput. Complexity 16 (2007), no. 4, 365\u2013411.","DOI":"10.1007\/s00037-007-0234-9"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_040_w2aab3b7e2148b1b6b1ab2b1c40Aa","doi-asserted-by":"crossref","unstructured":"D. Micciancio, On the hardness of learning with errors with binary secrets, Theory Comput. 14 (2018), Article ID 13.","DOI":"10.4086\/toc.2018.v014a013"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_041_w2aab3b7e2148b1b6b1ab2b1c41Aa","doi-asserted-by":"crossref","unstructured":"G. Myerson, On resultants, Proc. Amer. Math. Soc. 89 (1983), no. 3, 419\u2013420.","DOI":"10.1090\/S0002-9939-1983-0715856-2"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_042_w2aab3b7e2148b1b6b1ab2b1c42Aa","doi-asserted-by":"crossref","unstructured":"R. Nayak, C. V. Sastry and J. Pradhan, A matrix formulation for NTRU cryptosystem, 16th IEEE International Conference on Networks, IEEE Press, Piscataway (2008), 1\u20135.","DOI":"10.1109\/ICON.2008.4772602"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_043_w2aab3b7e2148b1b6b1ab2b1c43Aa","unstructured":"H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory, Probl. Control Inf. Theory 15 (1986), no. 2, 159\u2013166."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_044_w2aab3b7e2148b1b6b1ab2b1c44Aa","doi-asserted-by":"crossref","unstructured":"C. Peikert, V. Vaikuntanathan and B. Waters, A framework for efficient and composable oblivious transfer, Advances in Cryptology\u2014CRYPTO 2008, Lecture Notes in Comput. Sci. 5157, Springer, Berlin (2008), 554\u2013571.","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_045_w2aab3b7e2148b1b6b1ab2b1c45Aa","doi-asserted-by":"crossref","unstructured":"E. Prange, The use of information sets in decoding cyclic codes, IRE Trans. IT-8 (1962), S5\u2013S9.","DOI":"10.1109\/TIT.1962.1057777"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_046_w2aab3b7e2148b1b6b1ab2b1c46Aa","doi-asserted-by":"crossref","unstructured":"O. Regev, On lattices, learning with errors, random linear codes, and cryptography, Proceedings of the 37th Annual ACM Symposium on Theory of Computing\u2014STOC\u201905, ACM, New York (2005), 84\u201393.","DOI":"10.1145\/1060590.1060603"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_047_w2aab3b7e2148b1b6b1ab2b1c47Aa","unstructured":"P. Santini, E. Persichetti and M. Baldi, Reproducible codes and cryptographic applications, Cryptology ePrint Archive (2018), https:\/\/eprint.iacr.org\/2018\/666."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_048_w2aab3b7e2148b1b6b1ab2b1c48Aa","doi-asserted-by":"crossref","unstructured":"D. Stehl\u00e9, R. Steinfeld, K. Tanaka and K. Xagawa, Efficient public key encryption based on ideal lattices (extended abstract), Advances in Cryptology\u2014ASIACRYPT 2009, Lecture Notes in Comput. Sci. 5912, Springer, Berlin (2009), 617\u2013635.","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"2025120600172429486_j_jmc-2019-0032_ref_049_w2aab3b7e2148b1b6b1ab2b1c49Aa","unstructured":"A. Szepieniec, Ramstake, Technical report, National Institute of Standards and Technology, 2018."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_050_w2aab3b7e2148b1b6b1ab2b1c50Aa","unstructured":"NIST. Post-quantum crypto standardization, 2018."},{"key":"2025120600172429486_j_jmc-2019-0032_ref_051_w2aab3b7e2148b1b6b1ab2b1c51Aa","unstructured":"NIST. Submission to the NIST call for PQC proposals, 2018."}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jmc\/14\/1\/article-p202.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2019-0032\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2019-0032\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:18:25Z","timestamp":1764980305000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2019-0032\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":51,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,8,7]]},"published-print":{"date-parts":[[2020,8,7]]}},"alternative-id":["10.1515\/jmc-2019-0032"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2019-0032","relation":{},"ISSN":["1862-2984","1862-2976"],"issn-type":[{"type":"electronic","value":"1862-2984"},{"type":"print","value":"1862-2976"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}