{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:26:18Z","timestamp":1774448778991,"version":"3.50.1"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030778859","type":"print"},{"value":"9783030778866","type":"electronic"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77886-6_15","type":"book-chapter","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:06:10Z","timestamp":1623798370000},"page":"438-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Message-Recovery Laser Fault Injection Attack on the Classic McEliece Cryptosystem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6708-868X","authenticated-orcid":false,"given":"Pierre-Louis","family":"Cayrel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6028-3028","authenticated-orcid":false,"given":"Brice","family":"Colombier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8673-9097","authenticated-orcid":false,"given":"Vlad-Florin","family":"Dr\u0103goi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Menu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7964-3137","authenticated-orcid":false,"given":"Lilian","family":"Bossuet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,16]]},"reference":[{"key":"15_CR1","unstructured":"Albrecht, M.R., et al.: Classic McEliece, submission to the NIST post quantum standardization process (November 2017)"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Andersen, E.D., Andersen, K.D.: The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.) High performance optimization, vol. 33, pp. 197\u2013232. Springer, Boston (2000) https:\/\/doi.org\/10.1007\/978-1-4757-3216-0_8","DOI":"10.1007\/978-1-4757-3216-0_8"},{"key":"15_CR3","unstructured":"Aragon, N., et al.: BIKE: Bit Flipping Key Encapsulation, submission to the NIST post quantum standardization process (December 2017)"},{"key":"15_CR4","unstructured":"Aragon, N., et al.: Rollo (merger of Rank-Ouroboros, LAKE and LOCKER). Second round submission to the NIST post-quantum cryptography call (2020)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-79063-3_1","volume-title":"Post-Quantum Cryptography","author":"M Baldi","year":"2018","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 3\u201324. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_1"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Barenghi, A., Bertoni, G.M., Breveglieri, L., Pellicioli, M., Pelosi, G.: Fault attack on AES with single-bit induced faults. In: International Conference on Information Assurance and Security, pp. 167\u2013172. Atlanta, IEEE (August 2010)","DOI":"10.1109\/ISIAS.2010.5604061"},{"key":"15_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","author":"A Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $$2^{n\/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"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theor. 24(3), 384\u2013386 (1978)","DOI":"10.1109\/TIT.1978.1055873"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: Post-quantum cryptography. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, 2nd edn., pp. 949\u2013950. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_386","DOI":"10.1007\/978-1-4419-5906-5_386"},{"key":"15_CR10","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Organisation, Athena Scientific Optimization and Computation Series, vol. 6. Athena Scientific, Belmont (1997)"},{"key":"15_CR11","unstructured":"Borghoff, J.: Mixed-integer linear programming in the analysis of trivium and ktantan. IACR Cryptology ePrint Archive 2012, 676 (2012). http:\/\/eprint.iacr.org\/2012\/676"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-10868-6_9","volume-title":"Cryptography and Coding","author":"J Borghoff","year":"2009","unstructured":"Borghoff, J., Knudsen, L.R., Stolpe, M.: Bivium as a mixed-integer linear programming problem. In: Parker, M.G. (ed.) IMACC 2009. LNCS, vol. 5921, pp. 133\u2013152. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10868-6_9"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Bukasa, S.K., Lashermes, R., Lanet, J., Legay, A.: Let\u2019s shock our IoT\u2019s heart: ARMv7-M under (fault) attacks. In: Doerr, S., Fischer, M., Schrittwieser, S., Herrmann, D. (eds.) International Conference on Availability, Reliability and Security, pp. 33:1\u201333:6. ACM, Hamburg, Germany (August 2018)","DOI":"10.1145\/3230833.3230842"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Colombier, B., Menu, A., Dutertre, J.M., Mo\u00ebllic, P.A., Rigaud, J.B., Danger, J.L.: Laser-induced single-bit faults in flash memory: Instructions corruption on a 32-bit microcontroller. In: IEEE International Symposium on Hardware Oriented Security and Trust, pp. 1\u201310. McLean, VA, USA (May 2019)","DOI":"10.1109\/HST.2019.8741030"},{"key":"15_CR15","first-page":"339","volume":"13","author":"GB Dantzig","year":"1951","unstructured":"Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. Activity Anal. Prod. Allocation 13, 339\u2013347 (1951)","journal-title":"Activity Anal. Prod. Allocation"},{"issue":"6","key":"15_CR16","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.15837\/ijccc.2020.5.3920","volume":"15","author":"VF Dragoi","year":"2020","unstructured":"Dragoi, V.F., Cayrel, P.L., Colombier, B., Bucerzan, D., Hoara, S.: Solving a modified syndrome decoding problem using integer programming. Int. J. Comput. Commun. Control 15(5), 1\u20139 (2020)","journal-title":"Int. J. Comput. Commun. Control"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-35055-0_14","volume-title":"Secure IT Systems","author":"J-M Dutertre","year":"2019","unstructured":"Dutertre, J.-M., Riom, T., Potin, O., Rigaud, J.-B.: Experimental analysis of the laser-induced instruction skip fault model. In: Askarov, A., Hansen, R.R., Rafnsson, W. (eds.) NordSec 2019. LNCS, vol. 11875, pp. 221\u2013237. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35055-0_14"},{"key":"15_CR19","unstructured":"Feldman, J.: Decoding error-correcting codes via linear programming. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (2003)"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TIT.2004.842696","volume":"51","author":"J Feldman","year":"2005","unstructured":"Feldman, J., Wainwright, M.J., Karger, D.R.: Using linear programming to decode binary linear codes. IEEE Trans. Inf. Theory 51(3), 954\u2013972 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11506447_4","volume-title":"Advanced Encryption Standard","author":"C Giraud","year":"2005","unstructured":"Giraud, C.: DFA on AES. In: Dobbertin, H., Rijmen, V., Sowa, A. (eds.) AES 2004. LNCS, vol. 3373, pp. 27\u201341. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11506447_4"},{"issue":"7","key":"15_CR22","doi-asserted-by":"publisher","first-page":"4753","DOI":"10.1109\/TIT.2012.2191697","volume":"58","author":"M Helmling","year":"2012","unstructured":"Helmling, M., Ruzika, S., Tanatmis, A.: Mathematical programming decoding of binary linear codes: theory and algorithms. IEEE Trans. Inf. Theory 58(7), 4753\u20134769 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"15_CR23","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"EL Johnson","year":"2000","unstructured":"Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P.: Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J. Comput. 12(1), 2\u201323 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"15_CR24","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013396 (1984)","journal-title":"Combinatorica"},{"issue":"3","key":"15_CR25","first-page":"159","volume":"3","author":"V Klee","year":"1972","unstructured":"Klee, V., Minty, G.J.: How good is the simplex algorithm. Inequalities 3(3), 159\u2013175 (1972)","journal-title":"Inequalities"},{"issue":"177","key":"15_CR26","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-3-030-64837-4_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Lahr","year":"2020","unstructured":"Lahr, N., Niederhagen, R., Petri, R., Samardjiska, S.: Side channel information set decoding using iterative chunking. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 881\u2013910. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_29"},{"key":"15_CR28","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","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., 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"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Lee, Y.T., Sidford, A.: Efficient inverse maintenance and faster algorithms for linear programming. In: Guruswami, V. (ed.) IEEE Annual Symposium on Foundations of Computer Science, pp. 230\u2013249. IEEE Computer Society, Berkeley, CA, USA (October 2015)","DOI":"10.1109\/FOCS.2015.23"},{"issue":"5","key":"15_CR30","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"JS Leon","year":"1988","unstructured":"Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inf. Theory 34(5), 1354\u20131359 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Liao, H., Gebotys, C.H.: Methodology for EM fault injection: charge-based fault model. In: Teich, J., Fummi, F. (eds.) Design, Automation & Test in Europe Conference & Exhibition, pp. 256\u2013259. IEEE, Florence, Italy (March 2019)","DOI":"10.23919\/DATE.2019.8715150"},{"key":"15_CR32","doi-asserted-by":"publisher","unstructured":"Luppold, A., Oehlert, D., Falk, H.: Evaluating the performance of solvers for integer-linear programming. Technical Report, Hamburg University of Technology (2018). https:\/\/doi.org\/10.15480\/882.1839, https:\/\/tore.tuhh.de\/handle\/11420\/1842","DOI":"10.15480\/882.1839"},{"key":"15_CR33","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes, vol.\u00a016. Elsevier, New York (1977)"},{"key":"15_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":"15_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":"15_CR36","unstructured":"McEliece, R.J.: A public-key system based on algebraic. Coding Theory 4244, 114\u2013116 (1978)"},{"issue":"1","key":"15_CR37","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","volume":"3","author":"N Megiddo","year":"1991","unstructured":"Megiddo, N.: On finding primal- and dual-optimal bases. INFORMS J. Comput. 3(1), 63\u201365 (1991)","journal-title":"INFORMS J. Comput."},{"key":"15_CR38","doi-asserted-by":"crossref","unstructured":"Menu, A., Dutertre, J., Rigaud, J., Colombier, B., Mo\u00ebllic, P., Danger, J.: Single-bit laser fault model in NOR flash memories: analysis and exploitation. In: Workshop on Fault Detection and Tolerance in Cryptography, pp. 41\u201348. IEEE, Milan, Italy (September 2020)","DOI":"10.1109\/FDTC51366.2020.00013"},{"key":"15_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"key":"15_CR40","doi-asserted-by":"crossref","unstructured":"Moro, N., Dehbaoui, A., Heydemann, K., Robisson, B., Encrenaz, E.: Electromagnetic fault injection: Towards a fault model on a 32-bit microcontroller. In: Fischer, W., Schmidt, J. (eds.) Workshop on Fault Diagnosis and Tolerance in Cryptography, pp. 77\u201388. IEEE Computer Society, Los Alamitos, CA, USA (August 2013)","DOI":"10.1109\/FDTC.2013.9"},{"key":"15_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-34704-7_5","volume-title":"Information Security and Cryptology","author":"N Mouha","year":"2012","unstructured":"Mouha, N., Wang, Q., Gu, D., Preneel, B.: Differential and linear cryptanalysis using mixed-integer linear programming. In: Wu, C.-K., Yung, M., Lin, D. (eds.) Inscrypt 2011. LNCS, vol. 7537, pp. 57\u201376. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34704-7_5"},{"issue":"2","key":"15_CR42","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Prob. Control Inf. Theory"},{"issue":"5","key":"15_CR43","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"},{"issue":"2","key":"15_CR44","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 public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"15_CR45","doi-asserted-by":"crossref","unstructured":"Rivi\u00e8re, L., Najm, Z., Rauzy, P., Danger, J., Bringer, J., Sauvage, L.: High precision fault injections on the instruction cache of armv7-m architectures. In: IEEE International Symposium on Hardware Oriented Security and Trust. pp. 62\u201367. IEEE Computer Society, Washington, DC, USA (May 2015)","DOI":"10.1109\/HST.2015.7140238"},{"key":"15_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-68487-7_3","volume-title":"Smart Card Research and Advanced Applications","author":"J Roth","year":"2021","unstructured":"Roth, J., Karatsiolis, E., Kr\u00e4mer, J.: Classic McEliece implementation with\u00a0low memory footprint. In: Liardet, P.-Y., Mentens, N. (eds.) CARDIS 2020. LNCS, vol. 12609, pp. 34\u201349. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68487-7_3"},{"issue":"5","key":"15_CR47","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"15_CR48","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"},{"issue":"9","key":"15_CR49","doi-asserted-by":"publisher","first-page":"5960","DOI":"10.1109\/TIT.2011.2161920","volume":"57","author":"MH Taghavi","year":"2011","unstructured":"Taghavi, M.H., Shokrollahi, A., Siegel, P.H.: Efficient implementation of linear programming decoding. IEEE Trans. Inf. Theory 57(9), 5960\u20135982 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"15_CR50","doi-asserted-by":"publisher","first-page":"3277","DOI":"10.1109\/TIT.2010.2048489","volume":"56","author":"A Tanatmis","year":"2010","unstructured":"Tanatmis, A., Ruzika, S., Hamacher, H.W., Punekar, M., Kienle, F., Wehn, N.: A separation algorithm for improved lp-decoding of linear block codes. IEEE Trans. Inf. Theory 56(7), 3277\u20133289 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR51","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: Speeding-up linear programming using fast matrix multiplication (extended abstract). In: Annual Symposium on Foundations of Computer Science, pp. 332\u2013337. IEEE Computer Society, Research Triangle Park, North Carolina, USA (October 1989)","DOI":"10.1109\/SFCS.1989.63499"},{"key":"15_CR52","doi-asserted-by":"crossref","unstructured":"Virtanen, P., et al.: SciPy 1.0: fundamental algorithms for scientific computing in python. Nature Methods 17(3), 261\u2013272 (2020)","DOI":"10.1038\/s41592-019-0686-2"},{"key":"15_CR53","doi-asserted-by":"crossref","unstructured":"Vontobel, P.O.: Interior-point algorithms for linear-programming decoding. In: Information Theory and Applications Workshop, pp. 433\u2013437. IEEE, San Diego, CA, USA (January 2008)","DOI":"10.1109\/ITA.2008.4601085"},{"key":"15_CR54","doi-asserted-by":"crossref","unstructured":"Wadayama, T.: An LP decoding algorithm based on primal path-following interior point method. In: International Symposium on Information Theory, pp. 389\u2013393. IEEE, Seoul, Korea (June 2009)","DOI":"10.1109\/ISIT.2009.5205741"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77886-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T00:08:17Z","timestamp":1718496497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77886-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778859","9783030778866"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77886-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"400","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":"78","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":"20% - 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":"at least 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":"21","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}