{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:15Z","timestamp":1772893035563,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030684860","type":"print"},{"value":"9783030684877","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":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-68487-7_3","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T09:31:57Z","timestamp":1611826317000},"page":"34-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Classic McEliece Implementation with\u00a0Low Memory Footprint"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Roth","sequence":"first","affiliation":[]},{"given":"Evangelos","family":"Karatsiolis","sequence":"additional","affiliation":[]},{"given":"Juliane","family":"Kr\u00e4mer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,29]]},"reference":[{"key":"3_CR1","unstructured":"Augot, D., et al.: Initial recommendations of long-term secure post-quantum systems (2015)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","volume-title":"Security and Cryptography for Networks","author":"M Baldi","year":"2008","unstructured":"Baldi, M., Bodrato, M., Chiaraluce, F.: A new analysis of the McEliece cryptosystem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) Security and Cryptography for Networks, pp. 246\u2013262. Springer, Berlin Heidelberg (2008)"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Baldi, M., Santini, P., Chiaraluce, F.: Soft McEliece: MDPC code-based McEliece cryptosystems with very compact keys through real-valued intentional errors. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT 2016), pp. 795\u2013799, July 2016. https:\/\/doi.org\/10.1109\/ISIT.2016.7541408","DOI":"10.1109\/ISIT.2016.7541408"},{"key":"3_CR4","unstructured":"Bernstein, D., et al.: Classic McEliece Supporting Documentation (2019)"},{"key":"3_CR5","unstructured":"Bernstein, D.J., Lange, T.: McTiny: fast high-confidence post-quantum key erasure for tiny network servers. Cryptology ePrint Archive, Report 2019\/1395 (2019). https:\/\/eprint.iacr.org\/2019\/1395"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-30057-8_9","volume-title":"Public Key Cryptography - PKC 2012","author":"PL Cayrel","year":"2012","unstructured":"Cayrel, P.L., Hoffmann, G., Persichetti, E.: Efficient implementation of a CCA2-secure variant of McEliece using generalized srivastava codes. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) Public Key Cryptography - PKC 2012, pp. 138\u2013155. Springer, Berlin Heidelberg (2012)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-04138-9_4","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"T Eisenbarth","year":"2009","unstructured":"Eisenbarth, T., G\u00fcneysu, T., Heyse, S., Paar, C.: MicroEliece: McEliece for embedded devices. In: Clavier, C., Gaj, K. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2009, pp. 49\u201364. Springer, Heidelberg (2009)"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10623-015-0036-z","volume":"79","author":"JC Faug\u00e8re","year":"2016","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., de Portzamparc, F., Tillich, J.P.: Structural cryptanalysis of McEliece schemes with compact keys. Designs Codes Crypt. 79(1), 87\u2013112 (2016). https:\/\/doi.org\/10.1007\/s10623-015-0036-z","journal-title":"Designs Codes Crypt."},{"key":"3_CR9","unstructured":"Golub, G.H., van Loan, C.F.: Matrix Computations, 4 edn. JHU Press (2013). http:\/\/www.cs.cornell.edu\/cv\/GVL4\/golubandvanloan.htm"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-12929-2_13","volume-title":"Post-Quantum Cryptography","author":"S Heyse","year":"2010","unstructured":"Heyse, S.: Low-Reiter: Niederreiter encryption scheme for embedded microcontrollers. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 165\u2013181. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_13"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-25405-5_10","volume-title":"Post-Quantum Cryptography","author":"S Heyse","year":"2011","unstructured":"Heyse, S.: Implementation of McEliece based on quasi-dyadic Goppa codes for embedded devices. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 143\u2013162. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_10"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-40349-1_16","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"S Heyse","year":"2013","unstructured":"Heyse, S., von Maurich, I., G\u00fcneysu, T.: Smaller keys for code-based cryptography: QC-MDPC McEliece implementations on embedded devices. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 273\u2013292. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_16"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-662-49384-7_17","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"A H\u00fclsing","year":"2016","unstructured":"H\u00fclsing, A., Rijneveld, J., Schwabe, P.: ARMed SPHINCS. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9614, pp. 446\u2013470. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49384-7_17"},{"key":"3_CR14","unstructured":"H\u00fclsing, A., et al.: Sphincs+. https:\/\/sphincs.org\/"},{"key":"3_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58575-3","volume-title":"Introduction to Coding Theory","author":"JH van Lint","year":"1998","unstructured":"van Lint, J.H.: Introduction to Coding Theory, 3rd edn. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-3-642-58575-3","edition":"3"},{"issue":"44","key":"3_CR16","first-page":"114","volume":"42","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep Space Network Prog. Rep. 42(44), 114\u2013116 (1978)","journal-title":"Deep Space Network Prog. Rep."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"Selected Areas in Cryptography","author":"R Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from Goppa codes. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 376\u2013392. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05445-7_24"},{"key":"3_CR18","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, 159\u2013166 (1986)","journal-title":"Prob. Control Inf. Theory"},{"key":"3_CR19","unstructured":"Shoup, V.: A proposal for an ISO standard for public key encryption (version 2.1), January 2002. https:\/\/www.shoup.net\/papers\/iso-2_1.pdf"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-33383-5_8","volume-title":"Information Security","author":"F Strenzke","year":"2012","unstructured":"Strenzke, F.: Solutions for the storage problem of McEliece public and private keys on memory-constrained platforms. In: Gollmann, D., Freiling, F.C. (eds.) ISC 2012. LNCS, vol. 7483, pp. 120\u2013135. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33383-5_8"}],"container-title":["Lecture Notes in Computer Science","Smart Card Research and Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68487-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T15:58:38Z","timestamp":1619279918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68487-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030684860","9783030684877"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68487-7_3","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":"29 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CARDIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Smart Card Research and Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cardis2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cardis2020.its.uni-luebeck.de\/","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":"26","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":"12","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":"46% - 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":"4","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,25","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":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}