{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T06:12:21Z","timestamp":1740809541892,"version":"3.38.0"},"reference-count":23,"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":[[2025,3,1]]},"DOI":"10.1587\/transfun.2024tap0003","type":"journal-article","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T22:10:41Z","timestamp":1725401441000},"page":"414-422","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Reconstruction in Key Recovery Attack on the QC-MDPC McEliece Cryptosystems"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Motonari","family":"OHTSUKA","sequence":"first","affiliation":[{"name":"Dept. of Computer Science, National Defense Academy of Japan"}]},{"given":"Takahiro","family":"ISHIMARU","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, National Defense Academy of Japan"}]},{"given":"Yuta","family":"TSUKIE","sequence":"additional","affiliation":[{"name":"Japan Air Self-Defense Force"}]},{"given":"Shingo","family":"KUKITA","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, National Defense Academy of Japan"}]},{"given":"Kohtaro","family":"WATANABE","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, National Defense Academy of Japan"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] P. Shor, \u201cAlgorithms for quantum computation: discrete logarithms and factoring,\u201d Proc. 35th Annual Symposium on Foundations of Computer Science, pp.124-134, 1994. 10.1109\/sfcs.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"2","unstructured":"[2] \u201cPost-Quantum Cryptography,\u201d Available: https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/"},{"key":"3","unstructured":"[3] R. McEliece, \u201cA public key cryptosystem based on algebraic coding theory,\u201d DSN Prog. Re., vol.42-44, pp.114-116, 1978."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T.P. Berger, P.L. Cayrel, P. Gaborit, and A. Otmani, \u201cReducing key length of the McEliece cryptosystem,\u201d International Conference on Cryptology in Africa, pp.77-97, Springer, 2009. 10.1007\/978-3-642-02384-2_6","DOI":"10.1007\/978-3-642-02384-2_6"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] M. Repka and P. Zajac, \u201cOverview of the McEliece cryptosystem and its security,\u201d Tatra Mountains Mathematical Publications, vol.60, no.1, pp.57-83, 2014. 10.2478\/tmmp-2014-0025","DOI":"10.2478\/tmmp-2014-0025"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] J. Bolkema, H. Gluesing-Luerssen, C.A. Kelley, K.E. Lauter, B. Malmskog, and J. Rosenthal, \u201cVariations of the McEliece cryptosystem,\u201d Algebraic Geometry for Coding Theory and Cryptography: IPAM, Los Angeles, CA, Feb. 2016, pp.129-150, Springer, 2017. 10.1007\/978-3-319-63931-4_5","DOI":"10.1007\/978-3-319-63931-4_5"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] R. Misoczki, J.P. Tillich, N. Sendrier, and P.S. Barreto, \u201cMDPC-McEliece: New McEliece variants from moderate density parity-check codes,\u201d 2013 IEEE International Symposium on Information Theory, pp.2069-2073, IEEE, 2013. 10.1109\/isit.2013.6620590","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Q. Guo, T. Johansson, and P.S. Wagner, \u201cA key recovery reaction attack on QC-MDPC,\u201d IEEE Trans. Inf. Theory, vol.65, no.3, pp.1845-1861, 2019. 10.1109\/tit.2018.2877458","DOI":"10.1109\/TIT.2018.2877458"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] I.E. Bocharova, T. Johansson, and B.D. Kudryashov, \u201cImproved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystem,\u201d 2019 IEEE International Symposium on Information Theory (ISIT), pp.1882-1886, IEEE, 2019. 10.1109\/isit.2019.8849839","DOI":"10.1109\/ISIT.2019.8849839"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] N. Drucker, S. Gueron, and D. Kostic, \u201cQC-MDPC decoders with several shades of gray,\u201d International Conference on Post-Quantum Cryptography, pp.35-50, Springer, 2020. 10.1007\/978-3-030-44223-1_3","DOI":"10.1007\/978-3-030-44223-1_3"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] H. Kaneko, \u201cLook-ahead bit-flipping decoding of MDPC code,\u201d 2022 IEEE International Symposium on Information Theory (ISIT), pp.2922-2927, IEEE, 2022. 10.1109\/isit50566.2022.9834767","DOI":"10.1109\/ISIT50566.2022.9834767"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. Nilsson, I.E. Bocharova, B.D. Kudryashov, and T. Johansson, \u201cA weighted bit flipping decoder for QC-MDPC-based cryptosystems,\u201d 2021 IEEE International Symposium on Information Theory (ISIT), pp.1266-1271, IEEE, 2021. 10.1109\/isit45174.2021.9517902","DOI":"10.1109\/ISIT45174.2021.9517902"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] N. Sendrier and V. Vasseur, \u201cAbout low DFR for QC-MDPC decoding,\u201d International Conference on Post-Quantum Cryptography, pp.20-34, Springer, 2020. 10.1007\/978-3-030-44223-1_2","DOI":"10.1007\/978-3-030-44223-1_2"},{"key":"14","unstructured":"[14] \u201cQC-MDPC decoder,\u201d https:\/\/github.com\/vvasseur\/qcmdpc_decoder"},{"key":"15","unstructured":"[15] H. Bartz and G. Liva, \u201cOn decoding schemes for the MDPC-McEliece cryptosystem,\u201d SCC 2019; 12th International ITG Conference on Systems, Communications and Coding, pp.1-6, VDE, 2019. 10.30420\/454862042"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] T. Fab\u0161i\u010d, V. Hromada, P. Stankovski, P. Zajac, Q. Guo, and T. Johansson, \u201cA reaction attack on the QC-LDPC McEliece cryptosystem,\u201d Post-Quantum Cryptography: 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 2017, Proceedings 8, pp.51-68, Springer, 2017. 10.1007\/978-3-319-59879-6_4","DOI":"10.1007\/978-3-319-59879-6_4"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] T.B. Paiva and R. Terada, \u201cImproving the efficiency of a reaction attack on the QC-MDPC McEliece,\u201d IEICE Trans. Fundamentals, vol.E101-A, no.10, pp.1676-1686, Oct. 2018. 10.1587\/transfun.e101.a.1676","DOI":"10.1587\/transfun.E101.A.1676"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] E. Berlekamp, R. McEliece, and H. Van Tilborg, \u201cOn the inherent intractability of certain coding problems,\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":"19","unstructured":"[19] K. Kurosawa and K. Inaba, \u201cConsideration on the NP completeness of linear codes,\u201d Trans. IEICE (Japanese Edition), vol.J68-A, no.9, pp.953-956, 1985."},{"key":"20","unstructured":"[20] \u201cBIKE (Bit Flipping Key Encapsulation),\u201d Available: https:\/\/\/bikesuite.org\/ (2024\/06\/05)."},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] S. Narisada, K. Fukushima, and S. Kiyomoto, \u201cMultiparallel MMT: faster ISD algorithm solving high-dimensional syndrome decoding problem,\u201d IEICE Trans Fundamentals, vol.E106-A, no.3, pp.241-252, March 2023. 10.1587\/transfun.2022cip0023","DOI":"10.1587\/transfun.2022CIP0023"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] K. Watanabe, M. Ohtsuka, and Y. Tsukie, \u201cADMM and reproducing sum-product decoding algorithm applied to QC-MDPC code-based McEliece cryptosystems,\u201d IEEE Trans. Inf. Theory, vol.70, no.3, pp.1774-1786, 2024. 10.1109\/tit.2023.3309035","DOI":"10.1109\/TIT.2023.3309035"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] E. Eaton, M. Lequesne, A. Parent, and N. Sendrier, \u201cQC-MDPC: A timing attack and a CCA2 KEM,\u201d Post-Quantum Cryptography, T. Lange and R. Steinwandt, eds., Cham, pp.47-76, Springer International Publishing, 2018. 10.1007\/978-3-319-79063-3_3","DOI":"10.1007\/978-3-319-79063-3_3"}],"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\/E108.A\/3\/E108.A_2024TAP0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:30:58Z","timestamp":1740799858000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/3\/E108.A_2024TAP0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024tap0003","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024TAP0003"}}