{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T18:56:40Z","timestamp":1768417000386,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T00:00:00Z","timestamp":1580774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T00:00:00Z","timestamp":1580774400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1651344"],"award-info":[{"award-number":["CNS-1651344"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1513671"],"award-info":[{"award-number":["CNS-1513671"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10623-020-00720-3","type":"journal-article","created":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T11:02:39Z","timestamp":1580814159000},"page":"993-1021","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Properties of constacyclic codes under the Schur product"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4344-7406","authenticated-orcid":false,"given":"Brett Hemenway","family":"Falk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Heninger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6253-1689","authenticated-orcid":false,"given":"Michael","family":"Rudow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,4]]},"reference":[{"issue":"5","key":"720_CR1","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","volume":"64","author":"C Aguilar-Melchor","year":"2018","unstructured":"Aguilar-Melchor C., Blazy O., Deneuville J., Gaborit P., Z\u00e9mor G.: Efficient encryption from random quasi-cyclic codes. IEEE Trans. Inf. Theory 64(5), 3927\u20133943 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"720_CR2","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ffa.2016.12.002","volume":"45","author":"N Aydin","year":"2017","unstructured":"Aydin N., Halilovi A.: A generalization of quasi-twisted codes: multi-twisted codes. Finite Fields Appl. 45, 96\u2013106 (2017).","journal-title":"Finite Fields Appl."},{"issue":"3","key":"720_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/A:1011283523000","volume":"24","author":"N Aydin","year":"2001","unstructured":"Aydin N., Siap I., Ray-Chaudhuri D.K.: The structure of 1-generator quasi-twisted codes and new linear codes. Des. Codes Cryptogr. 24(3), 313\u2013326 (2001).","journal-title":"Des. Codes Cryptogr."},{"key":"720_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/A:1011283523000","volume":"24","author":"N Aydin","year":"2001","unstructured":"Aydin N., Siap I., Ray-Chaudhuri D.K.: The structure of 1-generator quasi-twisted codes and new linear codes. Des. Codes Cryptogr. 24, 313\u2013326 (2001).","journal-title":"Des. Codes Cryptogr."},{"key":"720_CR5","unstructured":"Aydin N., Asamov T., Gulliver T.A.: Some open problems on quasi-twisted and related code constructions and good quaternary codes. In: Proceedings of IEEE ISIT\u2019 2007, Nice, France (2007)."},{"key":"720_CR6","doi-asserted-by":"crossref","unstructured":"Banegas G., Barreto P.S.L.M., Boidje B.O., Cayrel P.L., Dione G.N., Gaj K., Gueye C.T., Haeussler R., Klamti J.B., N\u2019diaye O., Nguyen D.T., Persichetti E., Ricardini J.E.: DAGS: Key encapsulation using dyadic GS codes. Cryptology ePrint Archive. Report 2017\/1037 (2017).","DOI":"10.1515\/jmc-2018-0027"},{"key":"720_CR7","doi-asserted-by":"crossref","unstructured":"Barelli E., Couvreur A.: An efficient structural attack on NIST submission DAGS. CoRR. arXiv:1805.05429 (2018).","DOI":"10.1007\/978-3-030-03326-2_4"},{"issue":"1","key":"720_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"TP Berger","year":"2005","unstructured":"Berger T.P., Loidreau P.: How to mask the structure of codes for a cryptographic use. Des. Codes Cryptogr. 35(1), 63\u201379 (2005).","journal-title":"Des. Codes Cryptogr."},{"key":"720_CR9","unstructured":"Berger T.P., Cayrel P.L., Gaborit P., Otmani A.: Reducing key length of the McEliece cryptosystem. In: AFRICACRYPT, pp. 77\u201397. Springer, Berlin (2009)."},{"key":"720_CR10","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)."},{"issue":"2","key":"720_CR11","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1109\/TIT.2018.2867873","volume":"65","author":"I Cascudo","year":"2018","unstructured":"Cascudo I.: On squares of cyclic codes. IEEE Trans. Inf. Theory 65(2), 1034\u20131047 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"720_CR12","first-page":"1","volume-title":"CRYPTO","author":"I Cascudo","year":"2009","unstructured":"Cascudo I., Chen H., Cramer R., Xing C.: Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field. In: Halevi S. (ed.) CRYPTO, pp. 1\u201321. Springer, Heidelberg (2009)."},{"issue":"3","key":"720_CR13","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1109\/TIT.2015.2393251","volume":"61","author":"I Cascudo","year":"2015","unstructured":"Cascudo I., Cramer R., Mirandola D., Z\u00e9mor G.: Squares of random linear codes. IEEE Trans. Inf. Theory 61(3), 1159\u20131173 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"720_CR14","doi-asserted-by":"crossref","unstructured":"Cascudo I., Gundersen J.S., Ruano D.: Squares of matrix-product codes. CoRR. arXiv:1903.05494 (2019).","DOI":"10.1016\/j.ffa.2019.101606"},{"key":"720_CR15","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"74","author":"A Couvreur","year":"2014","unstructured":"Couvreur A., Gaborit P., Gauthier-Uma\u00f1a V., Otmani A., Tillich J.P.: Distinguisher-based attacks on public-key cryptosystems using Reed\u2013Solomon codes. Des. Codes Cryptogr. 74, 641\u2013666 (2014).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"720_CR16","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1109\/TIT.2016.2574841","volume":"63","author":"A Couvreur","year":"2017","unstructured":"Couvreur A., Otmani A., Tillich J.P.: Polynomial time attack on wild McEliece over quadratic extensions. IEEE Trans. Inf. Theory 63(1), 404\u2013427 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"720_CR17","doi-asserted-by":"crossref","unstructured":"Couvreur A., Lequesne M., Tillich J.: Recovering short secret keys of RLCE in polynomial time. arXiv:1805.11489 (2018).","DOI":"10.1007\/978-3-030-25510-7_8"},{"key":"720_CR18","unstructured":"Cramer R., Damg\u00e5rd I., Maurer U.: General secure multi-party computation from any linear secret-sharing scheme. In: EUROCRYPT, pp. 316\u2013334. Springer, Heidelberg (2000)."},{"key":"720_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing\u2014An Information Theoretic Appoach","author":"R Cramer","year":"2015","unstructured":"Cramer R., Damg\u00e5rd I., Nielsen J.B.: Secure Multiparty Computation and Secret Sharing\u2014An Information Theoretic Appoach. Cambridge University Press, Cambridge (2015)."},{"key":"720_CR20","first-page":"279","volume-title":"EUROCRYPT","author":"JC Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re J.C., Otmani A., Perret L., Tillich J.P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert H. (ed.) EUROCRYPT, pp. 279\u2013298. Springer, Berlin (2010)."},{"issue":"10","key":"720_CR21","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"JC Faug\u00e8re","year":"2013","unstructured":"Faug\u00e8re J.C., Gauthier-Uma\u00f1a V., Otmani A., Perret L., Tillich J.P.: A distinguisher for high-rate McEliece cryptosystems. IEEE Trans. Inf. Theory 59(10), 6830\u20136844 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"720_CR22","unstructured":"Faure C., Minder L.: Cryptanalysis of the McEliece cryptosystem over hyperelliptic codes. In: Proceedings of the 11th international workshop on Algebraic and Combinatorial Coding Theory, ACCT, vol. 2008, pp. 99\u2013107 (2008)."},{"key":"720_CR23","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.ffa.2011.08.001","volume":"18","author":"Y Jia","year":"2012","unstructured":"Jia Y.: On quasi-twisted codes over finite fields. Finite Fields Appl. 18, 237\u2013257 (2012).","journal-title":"Finite Fields Appl."},{"issue":"3","key":"720_CR24","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.ffa.2005.11.006","volume":"13","author":"CJ Lim","year":"2007","unstructured":"Lim C.J.: Quasi-cyclic codes with cyclic constituent codes. Finite Fields Appl. 13(3), 516\u2013534 (2007).","journal-title":"Finite Fields Appl."},{"issue":"7","key":"720_CR25","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/18.959257","volume":"47","author":"S Ling","year":"2001","unstructured":"Ling S., Sol\u00e9 P.: On the algebraic structure of quasi-cyclic codes. I. Finite fields. IEEE Trans. Inf. Theory 47(7), 2751\u20132760 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"720_CR26","unstructured":"Lyubashevsky V., Peikert C., Regev O.: A toolkit for ring-LWE cryptography. In: EUROCRYPT, pp. 35\u201354. Springer, Heidelberg (2013)."},{"key":"720_CR27","first-page":"114","volume":"42\u201344","author":"RJ McEliece","year":"1978","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42\u201344, 114\u2013116 (1978).","journal-title":"DSN Prog. Rep."},{"key":"720_CR28","unstructured":"Micciancio D., Regev O.: Lattice-Based Cryptography, pp. 147\u2013191. Springer, Berlin (2009)."},{"key":"720_CR29","unstructured":"Minder L., Shokrollahi A.: Cryptanalysis of the Sidelnikov cryptosystem. In: EUROCRYPT, pp. 347\u2013360. Springer, Heidelberg (2007)."},{"key":"720_CR30","unstructured":"Mirandola D.: Schur products of linear codes: a study of parameters. PhD Thesis, Universite de Bordeaux 1 (2012)."},{"issue":"2","key":"720_CR31","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory 15(2), 159\u2013166 (1986).","journal-title":"Probl. Control Inf. Theory"},{"issue":"2","key":"720_CR32","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A Otmani","year":"2010","unstructured":"Otmani A., Tillich J.P., Dallot L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Math. Comput. Sci. 3(2), 129\u2013140 (2010).","journal-title":"Math. Comput. Sci."},{"issue":"1","key":"720_CR33","first-page":"012","volume":"855","author":"R Pellikaan","year":"2017","unstructured":"Pellikaan R., M\u00e1rquez-Corbella I.: Error-correcting pairs for a public-key cryptosystem. J. Phys. Conf. Ser. 855(1), 012\u2013032 (2017).","journal-title":"J. Phys. Conf. Ser."},{"key":"720_CR34","unstructured":"Radkova D., Bojilov A., Zanten A.J.V.: Cyclic codes and quasi-twisted codes: an algebraic approach. Sofia University, Tech. Rep. (2007)."},{"key":"720_CR35","unstructured":"Randriambololona H.: On Products and Powers of Linear Codes Under Componentwise Multiplication. Contemporary Mathematics, vol. 637. American Mathematical Society, Providence (2015)."},{"issue":"3","key":"720_CR36","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","volume":"4","author":"VM Sidelnikov","year":"1994","unstructured":"Sidelnikov V.M.: A public-key cryptosystem based on binary Reed\u2013Muller codes. Discret. Math. Appl. 4(3), 191\u2013208 (1994).","journal-title":"Discret. Math. Appl."},{"key":"720_CR37","doi-asserted-by":"crossref","unstructured":"Wang Y.: Quantum resistant random linear code based public key encryption scheme rlce. In: ISIT, pp. 2519\u20132523 (2016).","DOI":"10.1109\/ISIT.2016.7541753"},{"key":"720_CR38","doi-asserted-by":"crossref","unstructured":"Wieschebrink C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: ISIT, pp. 1733\u20131737 (2006).","DOI":"10.1109\/ISIT.2006.261651"},{"key":"720_CR39","doi-asserted-by":"crossref","unstructured":"Wieschebrink C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. In: Post-Quantum Cryptography, pp. 61\u201372 (2010).","DOI":"10.1007\/978-3-642-12929-2_5"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00720-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-020-00720-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00720-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T00:52:22Z","timestamp":1612313542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-020-00720-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,4]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["720"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00720-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,4]]},"assertion":[{"value":"17 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}