{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:30:20Z","timestamp":1742967020261,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"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_2","type":"book-chapter","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T16:04:08Z","timestamp":1680019448000},"page":"21-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Verifying Classic McEliece: Examining the\u00a0Role of\u00a0Formal Methods in\u00a0Post-Quantum Cryptography Standardisation"],"prefix":"10.1007","author":[{"given":"Martin","family":"Brain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Cid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachel","family":"Player","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wrenna","family":"Robson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"key":"2_CR1","unstructured":"Announcing four candidates to be standardized, plus fourth round candidates: CSRC. https:\/\/csrc.nist.gov\/News\/2022\/pqc-candidates-to-be-standardized-and-round-4. NIST Accessed 07 Sept 2022"},{"key":"2_CR2","unstructured":"Control Bits Verification. https:\/\/github.com\/linesthatinterlace\/verif-cb. Wrenna Robson Accessed 12 Sept 2022"},{"key":"2_CR3","unstructured":"Cryptography in Lean 4. https:\/\/github.com\/joehendrix\/lean-crypto. Joe Hendrix Accessed 7 Sept 2022"},{"key":"2_CR4","unstructured":"Cryptol-Specs. https:\/\/github.com\/GaloisInc\/cryptol-specs. Galois Incorporated Accessed 7 Jan 2022"},{"key":"2_CR5","unstructured":"Post-quantum cryptography: CSRC. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography. NIST Accessed 18 Jan 2022"},{"key":"2_CR6","unstructured":"PQC Verification. https:\/\/github.com\/linesthatinterlace\/pqc-verification. Wrenna Robson Accessed 7 Sept 2022"},{"key":"2_CR7","unstructured":"Affeldt, R.: A Coq formalization of information theory and linear error correcting codes (2022). https:\/\/github.com\/affeldt-aist\/infotheo"},{"key":"2_CR8","unstructured":"Albrecht, M.R., et al.: Classic McEliece: conservative code-based cryptography (2020). https:\/\/classic.mceliece.org\/nist\/mceliece-20201010.pdf"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Almeida, J.B., et al.: The last mile: high-assurance and high-speed cryptographic implementations. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 965\u2013982. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00028"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Barbosa, M., et al.: SoK: computer-aided cryptography. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 777\u2013795. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00008"},{"key":"2_CR11","unstructured":"Bernstein, D.J.: djbsort (2019). https:\/\/sorting.cr.yp.to"},{"key":"2_CR12","unstructured":"Bernstein, D.J.: Understanding binary-Goppa decoding (2019). https:\/\/cr.yp.to\/papers\/goppadecoding-20220320.pdf"},{"key":"2_CR13","unstructured":"Bernstein, D.J.: Verified fast formulas for control bits for permutation networks (2020). https:\/\/ia.cr\/2020\/1493. Cryptology ePrint Archive, Report 2020\/1493"},{"key":"2_CR14","unstructured":"Bernstein, D.J.: Fast verified post-quantum software. In: International Cryptographic Module Conference 2021 (2021)"},{"key":"2_CR15","unstructured":"Bernstein, D.J., et al.: NTRU Prime: round 3 (2020). https:\/\/ntruprime.cr.yp.to\/nist\/ntruprime-20201007.pdf"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-40349-1_15","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"DJ Bernstein","year":"2013","unstructured":"Bernstein, D.J., Chou, T., Schwabe, P.: McBits: fast constant-time code-based cryptography. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 250\u2013272. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_15"},{"key":"2_CR17","unstructured":"Bertot, Y., Huet, G., Cast\u00e9ran, P., Paulin-Mohring, C.: Interactive Theorem Proving and Program Development: Coq\u2019Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin (2013)"},{"key":"2_CR18","unstructured":"Bhargavan, K., et al.: Everest: towards a verified, drop-in replacement of HTTPS. In: 2nd Summit on Advances in Programming Languages (SNAPL 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-030-81685-8_31","volume-title":"Computer Aided Verification","author":"B Boston","year":"2021","unstructured":"Boston, B., et al.: Verified cryptographic code for everybody. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 645\u2013668. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_31"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Carter, K., Foltzer, A., Hendrix, J., Huffman, B., Tomb, A.: SAW: the software analysis workbench. In: Proceedings of the 2013 ACM SIGAda Annual Conference on High Integrity Language Technology, pp. 15\u201318 (2013)","DOI":"10.1145\/2527269.2527277"},{"key":"2_CR21","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":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-66787-4_11","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"T Chou","year":"2017","unstructured":"Chou, T.: McBits revisited. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 213\u2013231. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_11"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-319-96142-2_26","volume-title":"Computer Aided Verification","author":"A Chudnov","year":"2018","unstructured":"Chudnov, A., et al.: Continuous formal verification of amazon s2n. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10982, pp. 430\u2013446. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96142-2_26"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Erbsen, A., Philipoom, J., Gross, J., Sloan, R., Chlipala, A.: Simple high-level code for cryptographic arithmetic \u2013 with proofs, without compromises. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 1202\u20131219. IEEE (2019)","DOI":"10.1109\/SP.2019.00005"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Erk\u00f6k, L., Carlsson, M., Wick, A.: Hardware\/software co-verification of cryptographic algorithms using Cryptol. In: 2009 Formal Methods in Computer-Aided Design, pp. 188\u2013191. IEEE (2009)","DOI":"10.1109\/FMCAD.2009.5351121"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Fu, Y.F., Liu, J., Shi, X., Tsai, M.H., Wang, B.Y., Yang, B.Y.: Signed cryptographic program verification with typed cryptoline. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 1591\u20131606 (2019)","DOI":"10.1145\/3319535.3354199"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"The mathlib Community: The Lean mathematical library. In: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2020, pp. 367\u2013381, New York. Association for Computing Machinery (2020)","DOI":"10.1145\/3372885.3373824"},{"key":"2_CR28","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Progress Report, 4244:114\u2013116 (1978)"},{"issue":"01","key":"2_CR29","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MC.2020.3033613","volume":"54","author":"N Mouha","year":"2021","unstructured":"Mouha, N., Hailane, A.: The application of formal methods to real-world cryptographic algorithms, protocols, and systems. Computer 54(01), 29\u201338 (2021)","journal-title":"Computer"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-030-79876-5_37","volume-title":"Automated Deduction \u2013 CADE 28","author":"L Moura","year":"2021","unstructured":"Moura, L., Ullrich, S.: The Lean 4 theorem prover and programming language. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 625\u2013635. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_37"},{"key":"2_CR31","unstructured":"Robson, W.: Classic McEliece Verification (2022). https:\/\/github.com\/linesthatinterlace\/pqc-verification"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Zinzindohou\u00e9, J.K., Bhargavan, K., Protzenko, J., Beurdouche, B.: HACL*: a verified modern cryptographic library. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1789\u20131806 (2017)","DOI":"10.1145\/3133956.3134043"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T16:05:06Z","timestamp":1680019506000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29689-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031296888","9783031296895"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29689-5_2","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)"}}]}}