{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:14:46Z","timestamp":1757312086500},"reference-count":21,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,3,1]]},"DOI":"10.1587\/transfun.2022cip0023","type":"journal-article","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T22:13:21Z","timestamp":1667945601000},"page":"241-252","source":"Crossref","is-referenced-by-count":3,"title":["Multiparallel MMT: Faster ISD Algorithm Solving High-Dimensional Syndrome Decoding Problem"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Shintaro","family":"NARISADA","sequence":"first","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhide","family":"FUKUSHIMA","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinsaku","family":"KIYOMOTO","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] E. Berlekamp, R. McEliece, and H. van Tilborg, \u201cOn the inherent intractability of certain coding problems (corresp.),\u201d IEEE Trans. Inf. Theory, vol.24, no.3, pp.384-386, 1978. 10.1109\/tit.1978.1055873","DOI":"10.1109\/TIT.1978.1055873"},{"key":"2","unstructured":"[2] I. Dumer, \u201cOn minimum distance decoding of linear codes,\u201d Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, pp.50-52, 1991."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] A. May, A. Meurer, and E. Thomae, \u201cDecoding random linear codes in <i>\u00d5<\/i>(2<sup>0.054<i>n<\/i><\/sup>),\u201d International Conference on the Theory and Application of Cryptology and Information Security, pp.107-124, 2011. 10.1007\/978-3-642-25385-0_6","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] A. Becker, A. Joux, A. May, and A. Meurer, \u201cDecoding random binary linear codes in 2<sup><i>n<\/i>\/20<\/sup>: How 1+1=0 improves information set decoding,\u201d Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.520-536, 2012. 10.1007\/978-3-642-29011-4_31","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] A. May and I. Ozerov, \u201cOn computing nearest neighbors with applications to decoding of binary linear codes,\u201d Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.203-228, 2015. 10.1007\/978-3-662-46800-5_9","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] L. Both and A. May, \u201cDecoding linear codes with high error rate and its impact for LPN security,\u201d International Conference on Post-Quantum Cryptography, pp.25-46, 2018. 10.1007\/978-3-319-79063-3_2","DOI":"10.1007\/978-3-319-79063-3_2"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] J. Coffey and R. Goodman, \u201cThe complexity of information set decoding,\u201d IEEE Trans. Inf. Theory, vol.36, no.5, pp.1031-1037, 1990. 10.1109\/18.57202","DOI":"10.1109\/18.57202"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] A. Barg, E. Krouk, and H. van Tilborg, \u201cOn the complexity of minimum distance decoding of long linear codes,\u201d IEEE Trans. Inf. Theory, vol.45, no.5, pp.1392-1405, 1999. 10.1109\/18.771141","DOI":"10.1109\/18.771141"},{"key":"9","unstructured":"[9] E.A. Kruk, \u201cDecoding complexity bound for linear block codes,\u201d Problemy Peredachi Informatsii, vol.25, no.3, pp.103-107, 1989."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] A. Esser and E. Bellini, \u201cSyndrome decoding estimator,\u201d Public-Key Cryptography-PKC 2022, pp.112-141, 2022. 10.1007\/978-3-030-97121-2_5","DOI":"10.1007\/978-3-030-97121-2_5"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] M. Baldi, A. Barenghi, F. Chiaraluce, G. Pelosi, and P. Santini, \u201cA finite regime analysis of information set decoding algorithms,\u201d Algorithms, vol.12, no.10, p.209, 2019. 10.3390\/a12100209","DOI":"10.3390\/a12100209"},{"key":"12","unstructured":"[12] Y. Hamdaoui and N. Sendrier, \u201cA non asymptotic analysis of information set decoding,\u201d IACR Cryptol. ePrint Arch., vol.2013, p.162, 2013."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] C. Peters, \u201cInformation-set decoding for linear codes over F<i><sub>q<\/sub><\/i>,\u201d International Workshop on Post-Quantum Cryptography, pp.81-94, 2010. 10.1007\/978-3-642-12929-2_7","DOI":"10.1007\/978-3-642-12929-2_7"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] S. Heyse, R. Zimmermann, and C. Paar, \u201cAttacking code-based cryptosystems with information set decoding using special-purpose hardware,\u201d PQCrypto 2014, pp.126-141, 2014. 10.1007\/978-3-319-11659-4_8","DOI":"10.1007\/978-3-319-11659-4_8"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] S. Narisada, K. Fukushima, and S. Kiyomoto, \u201cFast GPU implementation of Dumer&apos;s algorithm solving the syndrome decoding problem,\u201d IEEE ISPA 2021, pp.971-977, 2021. 10.1109\/ispa-bdcloud-socialcom-sustaincom52081.2021.00136","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00136"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] A. Esser, A. May, and F. Zweydinger, \u201cMcEliece needs a break \u2014 Solving McEliece-1284 and Quasi-Cyclic-2918 with modern ISD,\u201d Advances in Cryptology-EUROCRYPT 2022, pp.433-457, 2022. 10.1007\/978-3-031-07082-2_16","DOI":"10.1007\/978-3-031-07082-2_16"},{"key":"17","unstructured":"[17] A. Esser, S. Ramos-Calderer, E. Bellini, J.I. Latorre, and M. Manzano, \u201cAn optimized quantum implementation of ISD on scalable quantum resources,\u201d arXiv preprint arXiv:2112.06157, 2021. 10.48550\/arXiv.2112.06157"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] S. Perriello, A. Barenghi, and G. Pelosi, \u201cA complete quantum circuit to solve the information set decoding problem,\u201d 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pp.366-377, IEEE, 2021. 10.1109\/qce52317.2021.00056","DOI":"10.1109\/QCE52317.2021.00056"},{"key":"19","unstructured":"[19] N. Aragon, J. Lavauzelle, and M. Lequesne, \u201cdecodingchallenge.org,\u201d 2019. http:\/\/decodingchallenge.org"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] E. Prange, \u201cThe use of information sets in decoding cyclic codes,\u201d IRE Trans. Inf. Theory, vol.8, no.5, pp.5-9, 1962. 10.1109\/tit.1962.1057777","DOI":"10.1109\/TIT.1962.1057777"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] D. Wagner, \u201cA generalized birthday problem,\u201d Annual International Cryptology Conference, pp.288-304, 2002. 10.1007\/3-540-45708-9_19","DOI":"10.1007\/3-540-45708-9_19"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/3\/E106.A_2022CIP0023\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T03:19:53Z","timestamp":1677899993000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/3\/E106.A_2022CIP0023\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022cip0023","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,1]]},"article-number":"2022CIP0023"}}