{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:20:58Z","timestamp":1775794858505,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030384708","type":"print"},{"value":"9783030384715","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38471-5_18","type":"book-chapter","created":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T22:04:42Z","timestamp":1578607482000},"page":"437-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Ternary Syndrome Decoding with Large Weight"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Bricout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Chailloux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Debris-Alazard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu","family":"Lequesne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,10]]},"reference":[{"key":"18_CR1","unstructured":"Aragon, N., et al.: BIKE. NIST Round 1 submission for Post-Quantum Cryptography, December 2017"},{"key":"18_CR2","unstructured":"Albrecht, M., Cid, C., Paterson, K.G., Tjhai, C.J., Tomlinson, M.: NTS-KEM. First round submission to the NIST post-quantum cryptography call, December 2017"},{"key":"18_CR3","unstructured":"Melchor, C.A., et al.: HQC. NIST Round 1 submission for Post-Quantum Cryptography, December 2017"},{"key":"18_CR4","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: LEDAcrypt. Second round submission to the NIST post-quantum cryptography call, January 2019"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20465-4_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Becker","year":"2011","unstructured":"Becker, A., Coron, J.-S., Joux, A.: Improved generic algorithms for hard knapsacks. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 364\u2013385. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-20465-4_21"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., et al.: Classic McEliece: conservative code-based cryptography. First round submission to the NIST post-quantum cryptography call, November 2017. \nhttps:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/Classic_McEliece.zip","DOI":"10.1007\/978-3-540-88702-7_1"},{"key":"18_CR7","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\u00a0+\u00a01\u00a0=\u00a00 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"issue":"3","key":"18_CR8","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. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0885-064X(89)90025-3","volume":"5","author":"M Chaimovich","year":"1989","unstructured":"Chaimovich, M., Freiman, G., Galil, Z.: Solving dense subset-sum problems by using analytical number theory. J. Complex. 5(3), 271\u2013282 (1989)","journal-title":"J. Complex."},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45682-1_10"},{"issue":"5","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1109\/18.57202","volume":"36","author":"JT Coffey","year":"1990","unstructured":"Coffey, J.T., Goodman, R.M.: The complexity of information set decoding. IEEE Trans. Inf. Theory 36(5), 1031\u20131037 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR12","unstructured":"Torres, R.C.: Asymptotic analysis of ISD algorithms for the \n$$q-$$\nary case. In: Proceedings of the Tenth International Workshop on Coding and Cryptography WCC 2017, September 2017"},{"key":"18_CR13","unstructured":"Debris-Alazard, T., Sendrier, N., Tillich, J.-P.: Surf: a new code-based signature scheme. Preprint, September 2017. \narXiv:1706.08065v3"},{"key":"18_CR14","unstructured":"Debris-Alazard, T., Sendrier, N., Tillich, J.-P.: Wave: a new code-based signature scheme. Cryptology ePrint Archive, Report 2018\/996, October 2018. \nhttps:\/\/eprint.iacr.org\/2018\/996"},{"key":"18_CR15","unstructured":"Dumer, I.: On minimum distance decoding of linear codes. In: Proceedings of the 5th Joint Soviet-Swedish International Workshop Information Theory, Moscow, pp. 50\u201352 (1991)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-31856-9_25","volume-title":"STACS 2005","author":"AD Flaxman","year":"2005","unstructured":"Flaxman, A.D., Przydatek, B.: Solving medium-density subset sum problems in expected polynomial time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 305\u2013314. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31856-9_25"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-55589-8_7","volume-title":"Codes, Cryptology and Information Security","author":"CT Gueye","year":"2017","unstructured":"Gueye, C.T., Klamti, J.B., Hirose, S.: Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \n$$\\mathbb{F}_q$$\n. In: El Hajji, S., Nitaj, A., Souidi, E.M. (eds.) C2SI 2017. LNCS, vol. 10194, pp. 96\u2013109. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-55589-8_7"},{"issue":"6","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1137\/0220072","volume":"20","author":"Z Galil","year":"1991","unstructured":"Galil, Z., Margalit, O.: An almost linear-time algorithm for the dense subset-sum problem. SIAM J. Comput. 20(6), 1157\u20131189 (1991)","journal-title":"SIAM J. Comput."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-47238-6_8","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"S Hirose","year":"2016","unstructured":"Hirose, S.: May-Ozerov algorithm for nearest-neighbor problem over \n$${\\mathbb{F}}_{q}$$\n and its application to information set decoding. In: Bica, I., Reyhanitabar, R. (eds.) SECITC 2016. LNCS, vol. 10006, pp. 115\u2013126. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-47238-6_8"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-13190-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Howgrave-Graham","year":"2010","unstructured":"Howgrave-Graham, N., Joux, A.: New generic algorithms for hard knapsacks. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 235\u2013256. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13190-5_12"},{"key":"18_CR22","unstructured":"Interlando, C., Khathuria, K., Rohrer, N., Rosenthal, J., Weger, V.: Generalization of the ball-collision algorithm. arXiv preprint \narXiv:1812.10955\n\n (2018)"},{"issue":"10","key":"18_CR23","doi-asserted-by":"publisher","first-page":"2669","DOI":"10.1109\/TIT.2002.802608","volume":"48","author":"T Johansson","year":"2002","unstructured":"Johansson, T., J\u00f6nsson, F.: On the complexity of some cryptographic problems based on the general decoding problem. IEEE Trans. Inf. Theory 48(10), 2669\u20132678 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR24","unstructured":"Lyubashevsky, V.: On random high density subset sums. Electronic Colloquium on Computational Complexity (ECCC), 1(007) (2005)"},{"key":"18_CR25","unstructured":"McEliece, R.J.: A public-key system based on algebraic coding theory, pp. 114\u2013116. Jet Propulsion Lab, DSN Progress Report 44 (1978)"},{"key":"18_CR26","unstructured":"Meurer, A.: A coding-theoretic approach to cryptanalysis. Ph.D. thesis, Ruhr University Bochum, November 2017"},{"key":"18_CR27","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 \n$$\\tilde{\\cal{O}}(2^{0.054n})$$\n. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25385-0_6"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. IACR Cryptology ePrint Archive, Report 2012\/409, 2012 (2012)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C Peters","year":"2010","unstructured":"Peters, C.: Information-set decoding for linear codes over F\n$$_{q}$$\n. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 81\u201394. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12929-2_7"},{"issue":"5","key":"18_CR30","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":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2011","unstructured":"Sendrier, N.: Decoding one out of many. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 51\u201367. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25405-5_4"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 1993","author":"J Stern","year":"1994","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 13\u201321. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-48329-2_2"},{"key":"18_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"D Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288\u2013304. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45708-9_19"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38471-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T22:06:19Z","timestamp":1578607579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38471-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030384708","9783030384715"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38471-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Waterloo, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uwaterloo.ca\/combinatorics-and-optimization\/news\/sac-2019-august-12-16-2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}