{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:02:44Z","timestamp":1773615764293,"version":"3.50.1"},"reference-count":13,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.3103\/s0146411619070125","type":"journal-article","created":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T10:02:40Z","timestamp":1583316160000},"page":"719-729","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Support Splitting Algorithm for Induced Codes"],"prefix":"10.3103","volume":"53","author":[{"given":"Yu. V.","family":"Kosolapov","sequence":"first","affiliation":[]},{"given":"A. N.","family":"Shigaev","sequence":"additional","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2020,3,4]]},"reference":[{"key":"7173_CR1","unstructured":"McEliece, R.J., A public-key cryptosystem based on algebraic coding theory, JPL Deep Space Network Prog. Rep., 1978, nos. 42\u201344, pp. 114\u2013116."},{"key":"7173_CR2","unstructured":"Sendrier, N. and Tillich, J.P., Code-Based Cryptography: New Security Solutions against a Quantum Adversary, ERCIM News, ERCIM, 2016. https:\/\/hal.archives-ouvertes.fr\/hal-01410068\/document."},{"key":"7173_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0470035706","volume-title":"The Art of Error Correcting Coding","author":"R.H. Morelos-Zaragoza","year":"2006","unstructured":"Morelos-Zaragoza, R.H., The Art of Error Correcting Coding, John Wiley & Sons, Inc., 2006, 2nd ed."},{"key":"7173_CR4","first-page":"439","volume":"2","author":"V.M. Sidel\u2019nikov","year":"1992","unstructured":"Sidel\u2019nikov, V.M. and Shestakov, S.O., On an encoding system constructed on the basis of generalized Reed-Solomon codes, Discrete Math. Appl., 1992, vol. 2, no. 4, pp. 439\u2013444.","journal-title":"Discrete Math. Appl."},{"key":"7173_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1515\/dma-2014-0024","volume":"24","author":"M.A. Borodin","year":"2014","unstructured":"Borodin, M.A. and Chizhov, I.V., Effective attack on the McEliece cryptosystem based on Reed-Muller codes, Discrete Math. Appl., 2014, vol. 24, no. 5, pp. 273\u2013280.","journal-title":"Discrete Math. Appl."},{"key":"7173_CR6","doi-asserted-by":"publisher","first-page":"464","DOI":"10.18255\/1818-1015-2015-4-464-482","volume":"22","author":"V.M. Deundyak","year":"2015","unstructured":"Deundyak, V.M. and Kosolapov, Yu.V., Algorithms for majority decoding of group codes, Model. Anal. Inf. Sist., 2015, vol. 22, no. 4, pp. 464\u2013482.","journal-title":"Model. Anal. Inf. Sist."},{"key":"7173_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.18255\/1818-1015-2016-2-137-152","volume":"23","author":"V.M. Deundyak","year":"2016","unstructured":"Deundyak, V.M. and Kosolapov, Yu.V., Cryptosystem based on induced group codes, Model. Anal. Inf. Sist., 2016, vol. 23, no. 2, pp. 137\u2013152.","journal-title":"Model. Anal. Inf. Sist."},{"key":"7173_CR8","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N. Sendrier","year":"2000","unstructured":"Sendrier, N., Finding the permutation between equivalent linear codes: The support splitting algorithm, IEEE Trans. IT, 2000, vol. 46, no. 4, pp. 1193\u20131203.","journal-title":"IEEE Trans. IT"},{"key":"7173_CR9","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1080\/09720529.2014.927650","volume":"18","author":"A. Haily","year":"2015","unstructured":"Haily, A. and Harzalla, D., On binary linear codes whose automorphism group is trivial, J. Discrete Math. Sci. Cryptogr., 2015, vol. 18, no. 5, pp. 495\u2013512.","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"7173_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K. and Verheul, E.R., Selecting cryptographic key sizes, J. Cryptol., 2001, vol. 14, no. 4, pp. 255\u2013293.","journal-title":"J. Cryptol."},{"key":"7173_CR11","first-page":"43","volume":"22","author":"V.M. Deundyak","year":"2017","unstructured":"Deundyak, V.M. and Kosolapov, Yu.V., The use of the tensor product of Reed-Muller codes in asymmetric McEliece type cryptosystem and analysis of its resistance to attacks on the cryptogram, Vychisl. Tekhnol., 2017, vol. 22, no. 4, pp. 43\u201360.","journal-title":"Vychisl. Tekhnol."},{"key":"7173_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0030367","volume":"453","author":"M. Girault","year":"1990","unstructured":"Girault, M., A (non-practical) three-pass identification protocol using coding theory, Advances in Cryptology AUSCRYPT'90; Lect. Notes Comput. Sci., 1990, vol. 453, pp. 265\u2013272.","journal-title":"Lect. Notes Comput. Sci."},{"key":"7173_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-38616-9_14","volume":"7932","author":"N. Sendrier","year":"2013","unstructured":"Sendrier, N. and Simos, D.E., The Hardness of Code Equivalence over \ud835\udd3dq and its application to code-based cryptography, Post-Quantum Cryptography. PQCrypto 2013; Lect. Notes Comput. Sci., 2013, vol. 7932, pp. 203\u2013216.","journal-title":"Lect. Notes Comput. Sci."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411619070125.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411619070125","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411619070125.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:04:17Z","timestamp":1773612257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411619070125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":13,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["7173"],"URL":"https:\/\/doi.org\/10.3103\/s0146411619070125","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"12 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}