{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T12:57:10Z","timestamp":1787749030952,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030401856","type":"print"},{"value":"9783030401863","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-40186-3_7","type":"book-chapter","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T00:03:52Z","timestamp":1581638632000},"page":"129-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Extending NIST\u2019s CAVP Testing of Cryptographic Hash Function Implementations"],"prefix":"10.1007","author":[{"given":"Nicky","family":"Mouha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"Celi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,2,14]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Massimo, J., Paterson, K.G., Somorovsky, J.: Prime and prejudice: primality testing under adversarial conditions. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 281\u2013298. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243787","DOI":"10.1145\/3243734.3243787"},{"key":"7_CR2","unstructured":"American National Standards Institute: Public Key Cryptography for the Financial Services Industry - Key Agreement and Key Transport Using Elliptic Curve Cryptography. ANSI X9.63 (2017). https:\/\/webstore.ansi.org\/standards\/ascx9\/ansix9632011r2017"},{"key":"7_CR3","unstructured":"Apple: Security - Apple Developer, September 2019. https:\/\/developer.apple.com\/security\/"},{"key":"7_CR4","unstructured":"Aumasson, J.P., Henzen, L., Meier, W., Phan, R.C.W.: SHA-3 proposal BLAKE. Submission to the NIST SHA-3 Competition (Round 3) (2010). http:\/\/131002.net\/blake\/blake.pdf"},{"key":"7_CR5","unstructured":"Bassham III, L.E., Hall, T.A.: The Secure Hash Algorithm Validation System (SHAVS), May 2014. https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Cryptographic-Algorithm-Validation-Program\/documents\/shs\/SHAVS.pdf"},{"key":"7_CR6","unstructured":"Bertoni, G., Daemen, J., Peeters, M., van Assche, G.: The Keccak SHA-3 submission. Submission to the NIST SHA-3 Competition (Round 3) (2011). http:\/\/keccak.noekeon.org\/Keccak-submission-3.pdf"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-27954-6_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"BB Brumley","year":"2012","unstructured":"Brumley, B.B., Barbosa, M., Page, D., Vercauteren, F.: Practical realisation and elimination of an ECC-related software bug attack. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 171\u2013186. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_11"},{"key":"7_CR8","unstructured":"Celi, C.: ACVP Secure Hash Algorithm (SHA) JSON Specification. IETF Internet-Draft (2018). https:\/\/usnistgov.github.io\/ACVP\/artifacts\/draft-celi-acvp-sha-00.html"},{"key":"7_CR9","unstructured":"Cisco: The libacvp library, September 2019. https:\/\/github.com\/cisco\/libacvp"},{"key":"7_CR10","unstructured":"Google: Project Wycheproof tests crypto libraries against known attacks, September 2019. https:\/\/github.com\/google\/wycheproof"},{"key":"7_CR11","unstructured":"Industry Working Group on Automated Cryptographic Algorithm Validation: ACVP, September 2019. https:\/\/usnistgov.github.io\/ACVP\/"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1109\/TR.2018.2847247","volume":"67","author":"N Mouha","year":"2018","unstructured":"Mouha, N., Raunak, M.S., Kuhn, D.R., Kacker, R.: Finding bugs in cryptographic hash function implementations. IEEE Trans. Reliab. 67(3), 870\u2013884 (2018). https:\/\/doi.org\/10.1109\/TR.2018.2847247","journal-title":"IEEE Trans. Reliab."},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"National Bureau of Standards: Validating the Correctness of Hardware Implementations of the NBS Data Encryption Standard. NBS Special Publication 500\u201320, November 1977. https:\/\/doi.org\/10.6028\/NBS.SP.500-20e1977","DOI":"10.6028\/NBS.SP.500-20e1977"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Advanced Encryption Standard (AES). NIST Federal Information Processing Standards Publication 197, November 2001. https:\/\/doi.org\/10.6028\/NIST.FIPS.197","DOI":"10.6028\/NIST.FIPS.197"},{"key":"7_CR15","unstructured":"National Institute of Standards and Technology: Description of Known Answer Test (KAT) and Monte Carlo Test (MCT) for SHA-3 Candidate Algorithm Submissions, February 2008. https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Hash-Functions\/documents\/SHA3-KATMCT1.pdf"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Secure Hash Standard (SHS). NIST Federal Information Processing Standards Publication 180\u20134, August 2015. https:\/\/doi.org\/10.6028\/NIST.FIPS.180-4","DOI":"10.6028\/NIST.FIPS.180-4"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. NIST Federal Information Processing Standards Publication 202, August 2015. https:\/\/doi.org\/10.6028\/NIST.FIPS.202","DOI":"10.6028\/NIST.FIPS.202"},{"key":"7_CR18","unstructured":"National Institute of Standards and Technology and Canadian Centre for Cyber Security: Implementation Guidance for FIPS 140\u20132 and the Cryptographic Module Validation Program, August 2019. https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/cryptographic-module-validation-program\/documents\/fips140-2\/FIPS1402IG.pdf"},{"key":"7_CR19","unstructured":"SEI CERT C Coding Standard: INT17-C. Define integer constants in an implementation-independent manner, September 2019. https:\/\/wiki.sei.cmu.edu\/confluence\/display\/c\/INT17-C.+Define+integer+constants+in+an+implementation-independent+manner"},{"key":"7_CR20","unstructured":"The MITRE Corporation: CWE-835: Loop with Unreachable Exit Condition (\u2018Infinite Loop\u2019) (2019). https:\/\/cwe.mitre.org\/data\/definitions\/835.html"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Valenta, L., et al.: Measuring small subgroup attacks against Diffie-Hellman. In: 24th Annual Network and Distributed System Security Symposium, NDSS 2017, San Diego, California, USA, 26 February - 1 March, 2017. The Internet Society (2017). https:\/\/www.ndss-symposium.org\/ndss2017\/ndss-2017-programme\/measuring-small-subgroup-attacks-against-diffie-hellman\/","DOI":"10.14722\/ndss.2017.23171"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40186-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:45:10Z","timestamp":1710269110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40186-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030401856","9783030401863"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40186-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2020","order":10,"name":"conference_id","label":"Conference ID","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":"secure.iacr.org\/websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","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":"28","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":"29% - 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,25","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":"9","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)"}}]}}