{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:47:58Z","timestamp":1757620078349,"version":"3.44.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031952982"},{"type":"electronic","value":"9783031952999"}],"license":[{"start":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T00:00:00Z","timestamp":1753574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T00:00:00Z","timestamp":1753574400000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-95299-9_19","type":"book-chapter","created":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T06:43:54Z","timestamp":1753512234000},"page":"227-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Issue of Constructing Matrices that Reduce Code Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3539-4292","authenticated-orcid":false,"given":"A.","family":"Vodnev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,27]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and publickey cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun. ACM"},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theor. 31(4), 469\u2013472 (1985). https:\/\/doi.org\/10.1109\/TIT.1985.1057074","journal-title":"IEEE Trans. Inform. Theor."},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theor. 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"V\u2019eron, P.: Code based cryptography and steganography, algebraic informatics. In: Muntean, T., Poulakis, D., Rolland, R. (eds.) Proceedings of the 5th International Conference on Algebraic Informatics, CAI 2013, Porquerolles, France, 3\u20136 September 2013. LNCS, vol. 8080, pp. 9\u201346. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-40663-8_5","DOI":"10.1007\/978-3-642-40663-8_5"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Ovchinnikov, A.\u0410.: The variant of post-quantum cryptosystem based on burst-correcting codes and on the complete decoding problem. Informatsionno-upravliaiushchie sistemy (Inf. Control Syst.) 3, 45\u201354 (2022). https:\/\/doi.org\/10.31799\/1684-8853-2022-3-45-54","DOI":"10.31799\/1684-8853-2022-3-45-54"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Bavdekar, R., Chopde, E.J., Bhatia, A., Tiwari, K., Daniel, S.J., Atul: Post quantum cryptography: techniques, challenges, standardization, and directions for future research. Cryptography and Security (cs.CR). https:\/\/doi.org\/10.48550\/arXiv.2202.02826","DOI":"10.48550\/arXiv.2202.02826"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Davydov, V.V., Beliaev, V.V., Kustov, E.F., Leevik, A.G. Bezzateev, S.V.: Modern variations of McEliece and Niederreiter cryptosystems. Sci. Tech. J. Inf. Technol. Mech. Opt. 22(2), 324\u2013331 (2022). https:\/\/doi.org\/10.17586\/2226-1494-2022-22-2-324-331","DOI":"10.17586\/2226-1494-2022-22-2-324-331"},{"key":"19_CR8","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Progress Report 42-44 (1978). https:\/\/tmo.jpl.nasa.gov\/progress_report2\/42-44\/44N.PDF"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"TP Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) Progress in Cryptology \u2013 AFRICACRYPT 2009, pp. 77\u201397. Springer Berlin Heidelberg, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02384-2_6"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J-C 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.) Advances in Cryptology \u2013 EUROCRYPT 2010, pp. 279\u2013298. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology\u2014CRYPTO\u201996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) Advances in Cryptology\u2014CRYPTO\u201996, pp. 104\u2013113. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_9"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Barker, E.: NIST Special Publication (SP) 800-57 Part 1 Revision 4, Recommendation for Key Management \u2013 Part 1: General, National Inst. of Standards and Technology, Gaithersburg, MD, USA (2016). https:\/\/doi.org\/10.6028\/NIST.SP.800-57pt1r4","DOI":"10.6028\/NIST.SP.800-57pt1r4"},{"issue":"6","key":"19_CR13","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/MDT.2007.178","volume":"24","author":"T Eisenbarth","year":"2007","unstructured":"Eisenbarth, T., Kumar, S., Paar, C., Poschmann, A., Uhsadel, L.: A survey of lightweight-cryptography implementations. IEEE Des. Test Comput. 24(6), 522\u2013533 (2007). https:\/\/doi.org\/10.1109\/MDT.2007.178","journal-title":"IEEE Des. Test Comput."},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Ivanov, F., Krouk, E., Kreshchuk, A.: On the lightweight McEliece cryptosystem for low-power devices. In: Proceedings of the 2019 XVI International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY), Moscow, Russia, 21\u201325 October 2019, pp. 133\u2013138. https:\/\/doi.org\/10.1109\/REDUNDANCY48165.2019.9003324","DOI":"10.1109\/REDUNDANCY48165.2019.9003324"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1134\/S0032946022020077","volume":"58","author":"V Zyablov","year":"2022","unstructured":"Zyablov, V., Ivanov, F., Krouk, E., Sidorenko, V.R.: On new problems in asymmetric cryptography based on error-resistant coding. Probl. Inf. Transm. 58(2), 184\u2013201 (2022). https:\/\/doi.org\/10.1134\/S0032946022020077","journal-title":"Probl. Inf. Transm."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-030-54074-6_3","volume-title":"Code-Based Cryptography: 8th International Workshop, CBCrypto 2020, Zagreb, Croatia, May 9\u201310, 2020, Revised Selected Papers","author":"F Ivanov","year":"2020","unstructured":"Ivanov, F., Kabatiansky, G., Krouk, E., Rumenko, N.: A new code-based cryptosystem. In: Baldi, M., Persichetti, E., Santini, P. (eds.) Code-Based Cryptography: 8th International Workshop, CBCrypto 2020, Zagreb, Croatia, May 9\u201310, 2020, Revised Selected Papers, pp. 41\u201349. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54074-6_3"},{"key":"19_CR17","unstructured":"Krasavin, A.A.: (U|U+V) modification for McEliece cryptosystem. In: Proceedings of MIPT, vol. 10, no. 2 (2018)"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networks and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95299-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T04:33:56Z","timestamp":1757306036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95299-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,27]]},"ISBN":["9783031952982","9783031952999"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95299-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,7,27]]},"assertion":[{"value":"27 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NEW2AN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Next Generation Wired\/Wireless Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"new2an2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/new2an.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}