{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:15:48Z","timestamp":1743088548918,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031296888"},{"type":"electronic","value":"9783031296895"}],"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-29689-5_3","type":"book-chapter","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T16:04:08Z","timestamp":1680019448000},"page":"37-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Key-Recovery Fault Injection Attack on\u00a0the\u00a0Classic McEliece KEM"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Pircher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Geier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Danner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Mueller-Gritschneder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/TIT.1968.1054109","volume":"14","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Nonbinary BCH decoding (Abstr.). IEEE Trans. Inf. Theory 14(2), 242\u2013242 (1968). https:\/\/doi.org\/10.1109\/TIT.1968.1054109","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055873","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR3","unstructured":"Bernstein, D.J., et al.: Classic McEliece: NIST submission (2020). https:\/\/classic.mceliece.org\/nist.html. Accessed 19 Sept 2022"},{"key":"3_CR4","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":"3_CR5","unstructured":"Colombier, B., Dragoi, V.F., Cayrel, P.L., Grosso, V.: Message-recovery profiled side-channel attack on the Classic McEliece cryptosystem. Cryptology ePrint Archive, Paper 2022\/125 (2022). https:\/\/eprint.iacr.org\/2022\/125"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Danner, J., Kreuzer, M.: A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes. J. Groups Complex. Cryptol. 12(1), 2:1\u20132:20 (2020). https:\/\/doi.org\/10.46298\/jgcc.2020.12.1.6074. https:\/\/arxiv.org\/abs\/2002.01455","DOI":"10.46298\/jgcc.2020.12.1.6074"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Davide Schiavone, P., et al.: Slow and steady wins the race? A comparison of ultra-low-power RISC-V cores for Internet-of-Things applications. In: International Symposium on Power and Timing Modeling, Optimization and Simulation (PATMOS), vol. 27, pp. 1\u20138 (2017). https:\/\/doi.org\/10.1109\/PATMOS.2017.8106976","DOI":"10.1109\/PATMOS.2017.8106976"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Gautschi, M., et al.: Near-threshold RISC-V core with DSP extensions for scalable IoT endpoint devices. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 25(10), 2700\u20132713 (2017). https:\/\/doi.org\/10.1109\/TVLSI.2017.2654506","DOI":"10.1109\/TVLSI.2017.2654506"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/3-540-46416-6_46","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"JK Gibson","year":"1991","unstructured":"Gibson, J.K.: Equivalent Goppa codes and trapdoors to McEliece\u2019s public key cryptosystem. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 517\u2013521. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_46"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Guo, Q., Johansson, A., Johansson, T.: A key-recovery side-channel attack on Classic McEliece. Cryptology ePrint Archive, Paper 2022\/514 (2022). https:\/\/eprint.iacr.org\/2022\/514","DOI":"10.46586\/tches.v2022.i4.800-827"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Kirshanova, E., May, A.: Decoding McEliece with a hint - secret Goppa key parts reveal everything. Cryptology ePrint Archive, Paper 2022\/525 (2022). https:\/\/eprint.iacr.org\/2022\/525","DOI":"10.1007\/978-3-031-14791-3_1"},{"key":"3_CR12","unstructured":"MacWilliams, F., Sloane, N.: The Theory of Error-Correcting Codes, vol. 16, 1st edn. North-Holland (1983). ISBN 978-0-444-85193-2"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"JL Massey","year":"1969","unstructured":"Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122\u2013127 (1969). https:\/\/doi.org\/10.1109\/TIT.1969.1054260","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR14","first-page":"114","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep Space Netw. Progress Rep. 44, 114\u2013116 (1978)","journal-title":"Deep Space Netw. Progress Rep."},{"key":"3_CR15","unstructured":"National Institute for Standards and Technology: Submission Requirements and Evaluation Criteria for the Post-Quantum Cryptography Standardization Process (2016). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf. Accessed 19 Sept 2022"},{"key":"3_CR16","unstructured":"National Institute for Standards and Technology - Computer Security Division, Information Technology Laboratory: Post-Quantum Cryptography Standardization (2017). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization. Accessed 19 Sept 2022"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"National Institute of Standards: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. Technical report. Federal Information Processing Standard (FIPS) 202, U.S. Department of Commerce (2015). https:\/\/doi.org\/10.6028\/NIST.FIPS.202. https:\/\/csrc.nist.gov\/publications\/detail\/fips\/202\/final","DOI":"10.6028\/NIST.FIPS.202"},{"issue":"2","key":"3_CR18","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Probl. Control Inf. Theory"},{"key":"3_CR19","unstructured":"OpenHW Group: CV32E40P - GitHub. https:\/\/github.com\/openhwgroup\/cv32e40p. Accessed 25 Aug 2022"},{"key":"3_CR20","unstructured":"OpenHW Group: CV32E40S - GitHub. https:\/\/github.com\/openhwgroup\/cv32e40s. Accessed 25 Aug 2022"},{"issue":"2","key":"3_CR21","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). https:\/\/doi.org\/10.1109\/TIT.1975.1055350","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Selmke, B., Heyszl, J., Sigl, G.: Attack on a DFA protected AES by simultaneous laser fault injections. In: Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), pp. 36\u201346 (2016). https:\/\/doi.org\/10.1109\/FDTC.2016.16","DOI":"10.1109\/FDTC.2016.16"},{"key":"3_CR23","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/S0097539795293172. https:\/\/arxiv.org\/abs\/quant-ph\/9508027","DOI":"10.1137\/S0097539795293172"},{"key":"3_CR24","unstructured":"Snyder, W.: Verilator. https:\/\/www.veripool.org\/verilator\/. Accessed 25 Aug 2022"},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0019-9958(75)90090-X","volume":"27","author":"Y Sugiyama","year":"1975","unstructured":"Sugiyama, Y., Kasahara, M., Hirasawa, S., Namekawa, T.: A method for solving key equation for decoding Goppa codes. Inform. Control 27(1), 87\u201399 (1975). https:\/\/doi.org\/10.1016\/S0019-9958(75)90090-X","journal-title":"Inform. Control"},{"key":"3_CR26","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.5) (2022). https:\/\/www.sagemath.org"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-92075-3_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"K Xagawa","year":"2021","unstructured":"Xagawa, K., Ito, A., Ueno, R., Takahashi, J., Homma, N.: Fault-injection attacks against NIST\u2019s post-quantum cryptography round 3 KEM candidates. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 33\u201361. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_2"}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29689-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T16:04:37Z","timestamp":1680019477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29689-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031296888","9783031296895"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29689-5_3","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":"29 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"29 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cb-crypto.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":"23","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":"8","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}