{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:26:44Z","timestamp":1761294404771,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926403"},{"type":"electronic","value":"9783030926410"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92641-0_2","type":"book-chapter","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T08:03:33Z","timestamp":1639469013000},"page":"16-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Structural Properties of\u00a0Self-dual Monomial Codes with\u00a0Application to\u00a0Code-Based Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8673-9097","authenticated-orcid":false,"given":"Vlad-Florin","family":"Dr\u0103goi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4308-8810","authenticated-orcid":false,"given":"Andreea","family":"Szocs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,15]]},"reference":[{"key":"2_CR1","unstructured":"Aguilar-Melchor, C., et al.: Hamming quasi-cyclic (HQC) (2017). Submission to the NIST post quantum standardization process. https:\/\/pqc-hqc.org\/doc\/hqc-specification_2020-10-01.pdf"},{"key":"2_CR2","unstructured":"Albrecht, M.R., et al.: Classic McEliece, November 2017. Submission to the NIST post quantum standardization process. https:\/\/classic.mceliece.org\/nist\/mceliece-20201010.pdf"},{"key":"2_CR3","unstructured":"Aragon, N., et al.: BIKE: Bit Flipping Key Encapsulation, December 2017. Submission to the NIST post quantum standardization process. https:\/\/bikesuite.org\/files\/v4.1\/BIKE_Spec.2020.10.22.1.pdf"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-29360-8_9","volume-title":"Post-Quantum Cryptography","author":"M Bardet","year":"2016","unstructured":"Bardet, M., Chaulet, J., Dragoi, V., Otmani, A., Tillich, J.-P.: Cryptanalysis of the McEliece public key cryptosystem based on polar codes. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 118\u2013143. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_9"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bardet, M., Dragoi, V., Otmani, A., Tillich, J.: Algebraic properties of polar codes from a new polynomial formalism. In: IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10\u201315 July 2016, pp. 230\u2013234 (2016)","DOI":"10.1109\/ISIT.2016.7541295"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in 2n\/20: how 1+1=0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"issue":"3","key":"2_CR7","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. Inform. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Beiu, V., Dragoi, V.-F.: Fast reliability ranking of matchstick minimal networks. Networks 1\u201322 (2021, in press)","DOI":"10.1002\/net.22064"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-69284-5_10","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"D Bucerzan","year":"2017","unstructured":"Bucerzan, D., Dragoi, V., Kalachi, H.T.: Evolution of the McEliece public key encryption scheme. In: Farshim, P., Simion, E. (eds.) SecITC 2017. LNCS, vol. 10543, pp. 129\u2013149. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69284-5_10"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inform. Theory 44(1), 367\u2013378 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"2_CR11","doi-asserted-by":"publisher","first-page":"6000","DOI":"10.1109\/TIT.2012.2200651","volume":"58","author":"C Carlet","year":"2012","unstructured":"Carlet, C., Gaborit, P., Kim, J.L., Sole, P.: A new class of codes for boolean masking of cryptographic computations. IEEE Trans. Inf. Theor. 58(9), 6000\u20136011 (2012)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.ffa.2005.05.012","volume":"11","author":"W Cary Huffman","year":"2005","unstructured":"Cary Huffman, W.: On the classification and enumeration of self-dual codes. Finite Fields Their Appl. 11(3), 451\u2013490 (2005)","journal-title":"Finite Fields Their Appl."},{"issue":"3","key":"2_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. Inform. Theory 61(3), 1159\u20131173 (2015)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2_CR14","first-page":"273","volume":"24","author":"IV Chizhov","year":"2014","unstructured":"Chizhov, I.V., Borodin, M.A.: Effective attack on the McEliece cryptosystem based on Reed-Muller codes. Discrete Math. Appl. 24(5), 273\u2013280 (2014)","journal-title":"Discrete Math. Appl."},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0097-3165(80)90057-6","volume":"28","author":"J Conway","year":"1980","unstructured":"Conway, J., Pless, V.: On the enumeration of self-dual codes. J. Comb. Theory Ser. A 28(1), 26\u201353 (1980)","journal-title":"J. Comb. Theory Ser. A"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/2768577.2768606","volume":"49","author":"I Corbella","year":"2015","unstructured":"Corbella, I., Pellikaan, R.: Error-correcting pairs: a new approach to code-based cryptography. ACM Commun. Comput. Algebra 49, 21 (2015)","journal-title":"ACM Commun. Comput. Algebra"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"73","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-Solomon codes. Des. Codes Cryptogr. 73(2), 641\u2013666 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Dougherty, S.T., Mesnager, S., Sole, P.: Secret-sharing schemes based on self-dual codes. In: 2008 IEEE Information Theory Workshop, pp. 338\u2013342 (2008)","DOI":"10.1109\/ITW.2008.4578681"},{"key":"2_CR19","unstructured":"Dragoi, V.: Algebraic approach for the study of algorithmic problems coming from cryptography and the theory of error correcting codes. Theses, Universit\u00e9 de Rouen, France, July 2017. https:\/\/hal.archives-ouvertes.fr\/tel-01627324"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-030-12942-2_29","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"V Dr\u0103goi","year":"2019","unstructured":"Dr\u0103goi, V., Beiu, V., Bucerzan, D.: Vulnerabilities of the McEliece variants based on polar codes. In: Lanet, J.-L., Toma, C. (eds.) SECITC 2018. LNCS, vol. 11359, pp. 376\u2013390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12942-2_29"},{"issue":"1","key":"2_CR21","first-page":"17","volume":"25","author":"I Dumer","year":"1989","unstructured":"Dumer, I.: Two decoding algorithms for linear codes. Probl. Inf. Transm. 25(1), 17\u201323 (1989)","journal-title":"Probl. Inf. Transm."},{"key":"2_CR22","series-title":"The Springer International Series in Engineering and Computer Science (Communications and Information Theory)","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3585-7_17","volume-title":"Information, Coding and Mathematics","author":"I Dumer","year":"2002","unstructured":"Dumer, I., Shabunov, K.: Recursive list decoding for reed-muller codes and their subcodes. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds.) Information, Coding and Mathematics. The Springer International Series in Engineering and Computer Science (Communications and Information Theory), vol. 687. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4757-3585-7_17"},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/TIT.2005.864443","volume":"52","author":"I Dumer","year":"2006","unstructured":"Dumer, I., Shabunov, K.: Soft-decision decoding of Reed-Muller codes: recursive lists. IEEE Trans. Inf. Theory 52(3), 1260\u20131266 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.2478\/tmmp-2019-0007","volume":"73","author":"P D\u00f6m\u00f6si","year":"2019","unstructured":"D\u00f6m\u00f6si, P., Hannusch, C., Horv\u00e1th, G.: A cryptographic system based on a new class of binary error-correcting codes. Tatra Mountains Math. Publ. 73(1), 83\u201396 (2019)","journal-title":"Tatra Mountains Math. Publ."},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88\u2013105. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_6"},{"issue":"1","key":"2_CR26","first-page":"59","volume":"21","author":"C Hannusch","year":"2016","unstructured":"Hannusch, C., Lakatos, P.: Construction of self-dual binary $$[2^{2k},2^{2k-1},2^k]$$-codes. Algebra Discrete Math. 21(1), 59\u201368 (2016)","journal-title":"Algebra Discrete Math."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Jamali, M.V., Liu, X., Makkuva, A., Mahdavifar, H., Oh, S., Viswanath, P.: Reed-Muller Subcodes: machine learning-aided design of efficient soft recursive decoding. In: 2021 IEEE International Symposium on Information Theory (ISIT), pp. 1088\u20131093 (2021)","DOI":"10.1109\/ISIT45174.2021.9517885"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-59879-6_5","volume-title":"Post-Quantum Cryptography","author":"G Kachigar","year":"2017","unstructured":"Kachigar, G., Tillich, J.-P.: Quantum information set decoding algorithms. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 69\u201389. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_5"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201988","author":"PJ Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: Barstow, D., et al. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275\u2013280. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_25"},{"issue":"5","key":"2_CR30","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"J Leon","year":"1988","unstructured":"Leon, J.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inform. Theory 34(5), 1354\u20131359 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0012-365X(72)90030-1","volume":"3","author":"F MacWilliams","year":"1972","unstructured":"MacWilliams, F., Sloane, N., Thompson, J.: Good self dual codes exist. Discrete Math. 3(1), 153\u2013162 (1972)","journal-title":"Discrete Math."},{"key":"2_CR32","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1986","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 5th edn. North-Holland, Amsterdam (1986)","edition":"5"},{"key":"2_CR33","unstructured":"Mariot, L., Picek, S., Yorgova, R.: On McEliece type cryptosystems using self-dual codes with large minimum weight. Cryptology ePrint Archive, Report 2021\/837 (2021)"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in $$\\tilde{\\cal{O}}(2^{0.054n})$$. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_6"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A May","year":"2015","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 203\u2013228. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_9"},{"key":"2_CR36","unstructured":"McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab (1978). dSN Progress Report 44"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-72540-4_20","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"L Minder","year":"2007","unstructured":"Minder, L., Shokrollahi, A.: Cryptanalysis of the Sidelnikov cryptosystem. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 347\u2013360. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_20"},{"key":"2_CR38","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-30731-1","volume-title":"Self-Dual Codes and Invariant Theory","author":"G Nebe","year":"2006","unstructured":"Nebe, G., Rains, E.M., Sloane, N.J.A.: Self-Dual Codes and Invariant Theory. Algorithms and Computation in Mathematics, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-30731-1"},{"key":"2_CR39","unstructured":"Oggier, F., Z\u2019emor, G.: Coding constructions for efficient oblivious transfer from noisy channels (2020)"},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-18681-8_14","volume-title":"Codes, Cryptology, and Information Security","author":"A Otmani","year":"2015","unstructured":"Otmani, A., Kalachi, H.T.: Square code attack on a modified sidelnikov cryptosystem. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E.M. (eds.) C2SI 2015. LNCS, vol. 9084, pp. 173\u2013183. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18681-8_14"},{"key":"2_CR41","first-page":"368","volume":"106\u2013107","author":"R Pellikaan","year":"1992","unstructured":"Pellikaan, R.: On decoding by error location and dependent sets of error positions. Discrete Math. 106\u2013107, 368\u2013381 (1992)","journal-title":"Discrete Math."},{"issue":"1","key":"2_CR42","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(72)90034-9","volume":"3","author":"V Pless","year":"1972","unstructured":"Pless, V.: A classification of self-orthogonal codes over GF(2). Discrete Math. 3(1), 209\u2013246 (1972)","journal-title":"Discrete Math."},{"issue":"3","key":"2_CR43","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0097-3165(75)90042-4","volume":"18","author":"V Pless","year":"1975","unstructured":"Pless, V., Sloane, N.: On the classification and enumeration of self-dual codes. J. Comb. Theory Ser. A 18(3), 313\u2013335 (1975)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"5","key":"2_CR44","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Randriambololona, H.: On products and powers of linear codes under componentwise multiplication. Contemporary Mathematics (2015). https:\/\/hal.telecom-paris.fr\/hal-02287120","DOI":"10.1090\/conm\/637\/12749"},{"issue":"10","key":"2_CR46","doi-asserted-by":"publisher","first-page":"5245","DOI":"10.1109\/TIT.2010.2060130","volume":"56","author":"G Schmidt","year":"2010","unstructured":"Schmidt, G., Sidorenko, V.R., Bossert, M.: Syndrome decoding of Reed-Solomon codes beyond half the minimum distance based on shift-register synthesis. IEEE Trans. Inf. Theory 56(10), 5245\u20135252 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2_CR47","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. Inform. Theory 46(4), 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2_CR48","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/MSP.2017.3151345","volume":"15","author":"N Sendrier","year":"2017","unstructured":"Sendrier, N.: Code-based cryptography: state of the art and perspectives. IEEE Secur. Privacy 15(4), 44\u201350 (2017)","journal-title":"IEEE Secur. Privacy"},{"key":"2_CR49","doi-asserted-by":"crossref","unstructured":"Shrestha, S.R., Kim, Y.S.: New McEliece cryptosystem based on polar codes as a candidate for post-quantum cryptography. In: 2014 14th International Symposium on Communications and Information Technologies (ISCIT), pp. 368\u2013372. IEEE (2014)","DOI":"10.1109\/ISCIT.2014.7011934"},{"issue":"3","key":"2_CR50","doi-asserted-by":"publisher","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 cryptosytem based on Reed-Muller codes. Discrete Math. Appl. 4(3), 191\u2013207 (1994)","journal-title":"Discrete Math. Appl."},{"key":"2_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0019850"},{"key":"2_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-12929-2_5","volume-title":"Post-Quantum Cryptography","author":"C Wieschebrink","year":"2010","unstructured":"Wieschebrink, C.: Cryptanalysis of the niederreiter public key scheme based on GRS subcodes. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 61\u201372. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_5"},{"issue":"8","key":"2_CR53","doi-asserted-by":"publisher","first-page":"4948","DOI":"10.1109\/TIT.2020.2977917","volume":"66","author":"M Ye","year":"2020","unstructured":"Ye, M., Abbe, E.: Recursive projection-aggregation decoding of Reed-Muller codes. IEEE Trans. Inf. Theory 66(8), 4948\u20134965 (2020)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92641-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T08:04:22Z","timestamp":1639469062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92641-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926403","9783030926410"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92641-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IMACC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IMA International Conference on Cryptography and Coding","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ima2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ima.org.uk\/11167\/17th-ima-international-conference-on-cryptography-and-coding\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}