{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:14:19Z","timestamp":1742969659463,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031293702"},{"type":"electronic","value":"9783031293719"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-29371-9_11","type":"book-chapter","created":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T13:24:05Z","timestamp":1680182645000},"page":"219-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Key-Recovery by\u00a0Side-Channel Information on\u00a0the\u00a0Matrix-Vector Product in\u00a0Code-Based Cryptosystems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2362-601X","authenticated-orcid":false,"given":"Boly","family":"Seck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6708-868X","authenticated-orcid":false,"given":"Pierre-Louis","family":"Cayrel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9143-196X","authenticated-orcid":false,"given":"Idy","family":"Diop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8673-9097","authenticated-orcid":false,"given":"Vlad-Florin","family":"Dragoi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalen","family":"Couzon","sequence":"additional","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-3874-7527","authenticated-orcid":false,"given":"Vincent","family":"Grosso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,31]]},"reference":[{"key":"11_CR1","unstructured":"Aguilar Melchor, C., et al.: BIKE: bit flipping key encapsulation. In: NIST Post-Quantum Cryptography Standardization Project (Round 3) (2020)"},{"key":"11_CR2","unstructured":"Albrecht, M.R., et al.: Classic McEliece. In: NIST Post-Quantum Cryptography Standardization Project (Round 3) (2020). https:\/\/classic.mceliece.org"},{"key":"11_CR3","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"},{"key":"11_CR4","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. Theory 24(3), 384\u2013386 (1978)","DOI":"10.1109\/TIT.1978.1055873"},{"issue":"7671","key":"11_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1038\/nature23461","volume":"549","author":"DJ Bernstein","year":"2017","unstructured":"Bernstein, D.J., Lange, T.: Post-quantum cryptography. Nature 549(7671), 188\u2013194 (2017)","journal-title":"Nature"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.15837\/ijccc.2017.1.2780","volume":"12","author":"D Bucerzan","year":"2016","unstructured":"Bucerzan, D., Cayrel, P.-L., Dragoi, V., Richmond, T.: Improved timing attacks against the secret permutation in the McEliece PKC. Int. J. Comput. Commun. Control 12(1), 7\u201325 (2016)","journal-title":"Int. J. Comput. Commun. Control"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Buchmann, J.A., Butin, D., G\u00f6pfert, F., Petzoldt, A.: Post-quantum cryptography: state of the art. In: The New Codebreakers, pp. 88\u2013108 (2016)","DOI":"10.1007\/978-3-662-49301-4_6"},{"key":"11_CR8","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH (preliminary version). Cryptology ePrint Archive, Paper 2022\/975 (2022). https:\/\/eprint.iacr.org\/2022\/975"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-030-77886-6_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"P-L Cayrel","year":"2021","unstructured":"Cayrel, P.-L., Colombier, B., Dr\u0103goi, V.-F., Menu, A., Bossuet, L.: Message-recovery laser fault injection attack on the Classic McEliece cryptosystem. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 438\u2013467. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_15"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Colombier, B., Dr\u01cegoi, V.-F., Cayrel, P.-L., Grosso, V.: Profiled side-channel attack on cryptosystems based on the binary syndrome decoding problem. IEEE Trans. Inf. Forensics Secur., 3407\u20133420 (2022). https:\/\/doi.org\/10.1109\/TIFS.2022.3198277","DOI":"10.1109\/TIFS.2022.3198277"},{"key":"11_CR11","unstructured":"Feldman, J.: Decoding error-correcting codes via linear programming. Ph.D. thesis. Massachusetts Institute of Technology, Cambridge, MA USA (2003)"},{"issue":"3","key":"11_CR12","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":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-030-95312-6_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2022","author":"TB Fouotsa","year":"2022","unstructured":"Fouotsa, T.B., Petit, C.: A new adaptive attack on SIDH. In: Galbraith, S.D. (ed.) CT-RSA 2022. LNCS, vol. 13161, pp. 322\u2013344. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_14"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.cosrev.2018.11.002","volume":"31","author":"L Gyongyosi","year":"2019","unstructured":"Gyongyosi, L., Imre, S.: A survey on quantum computing technology. Comput. Sci. Rev. 31, 51\u201371 (2019)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s13389-019-00212-8","volume":"10","author":"B Hettwer","year":"2020","unstructured":"Hettwer, B., Gehrer, S., G\u00fcneysu, T.: Applications of machine learning techniques in side-channel attacks: a survey. J. Cryptographic Eng. 10(2), 135\u2013162 (2020)","journal-title":"J. Cryptographic Eng."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Jao, D., et al.: SIKE-Supersingular isogeny key encapsulation. In: NIST Round 3 (2020)","DOI":"10.1007\/978-3-642-27739-9_1572-1"},{"issue":"9","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1038\/s41567-021-01296-y","volume":"17","author":"MV Larsen","year":"2021","unstructured":"Larsen, M.V., Guo, X., Breum, C.R., Neergaard-Nielsen, J.S., Andersen, U.L.: Deterministic multi-mode gates on a scalable photonic quantum computing platform. Nature Phys. 17(9), 1018\u20131023 (2021)","journal-title":"Nature Phys."},{"key":"11_CR18","series-title":"LNCS","first-page":"275","volume-title":"EUROCRYPT 1988","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)"},{"issue":"5","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"JS Leon","year":"1998","unstructured":"Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inf. Theory 34(5), 1354\u20131359 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR20","unstructured":"Maino, L., Martindale, C.: An attack on SIDH with arbitrary starting curve. In: Cryptology ePrint Archive (2022)"},{"key":"11_CR21","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{\\mathcal{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":"11_CR22","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":"11_CR23","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic. Coding Thv. 4244, 114\u2013116 (1978)","journal-title":"Coding Thv."},{"key":"11_CR24","unstructured":"Melchor, C.A., et al.: Hamming Quasi-Cyclic (HQC). NIST Post-Quantum Cryptography Standardization Project (Round 3) (2020)"},{"issue":"2","key":"11_CR25","first-page":"157","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Contr. Inform. Theory 15(2), 157\u2013166 (1986)","journal-title":"Prob. Contr. Inform. Theory"},{"issue":"2","key":"11_CR26","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N Patterson","year":"1975","unstructured":"Patterson, N.: The algebraic decoding of Goppa codes. IEEE Trans. Inf. Theory 21(2), 203\u2013207 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"11_CR27","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":"11_CR28","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring\". In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)"},{"key":"11_CR29","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":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-12929-2_8","volume-title":"Post-Quantum Cryptography","author":"F Strenzke","year":"2010","unstructured":"Strenzke, F.: A timing attack against the secret permutation in the McEliece PKC. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 95\u2013107. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_8"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-38616-9_15","volume-title":"Post-Quantum Cryptography","author":"F Strenzke","year":"2013","unstructured":"Strenzke, F.: Timing attacks against the syndrome inversion in code-based cryptosystems. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 217\u2013230. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_15"},{"issue":"6","key":"11_CR32","doi-asserted-by":"publisher","DOI":"10.1063\/1.5100160","volume":"4","author":"S Takeda","year":"2019","unstructured":"Takeda, S., Furusawa, A.: Toward large-scale fault-tolerant universal photonic quantum computing. APL Photonics 4(6), 060902 (2019)","journal-title":"APL Photonics"},{"issue":"7","key":"11_CR33","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":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-89915-8_12","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"\u00c9 Tasso","year":"2021","unstructured":"Tasso, \u00c9., De Feo, L., El Mrabet, N., Ponti\u00e9, S.: Resistance of Isogeny-Based Cryptographic Implementations to a Fault Attack. In: Bhasin, S., De Santis, F. (eds.) COSADE 2021. LNCS, vol. 12910, pp. 255\u2013276. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89915-8_12"},{"issue":"11","key":"11_CR35","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1109\/TC.2020.3020407","volume":"69","author":"F Zhang","year":"2010","unstructured":"Zhang, F., et al.: Side-channel analysis and countermeasure design on ARM-based quantum-resistant SIKE. IEEE Trans. Comput. 69(11), 1681\u20131693 (2010)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29371-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T13:27:39Z","timestamp":1680182859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29371-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031293702","9783031293719"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29371-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","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":"24","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":"35% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}