{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:37:10Z","timestamp":1742971030143,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030755386"},{"type":"electronic","value":"9783030755393"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-75539-3_27","type":"book-chapter","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T23:36:24Z","timestamp":1620689784000},"page":"657-681","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Cost of ASIC Hardware Crackers: A SHA-1 Case Study"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Chattopadhyay","sequence":"first","affiliation":[]},{"given":"Mustafa","family":"Khairallah","sequence":"additional","affiliation":[]},{"given":"Ga\u00ebtan","family":"Leurent","sequence":"additional","affiliation":[]},{"given":"Zakaria","family":"Najm","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Peyrin","sequence":"additional","affiliation":[]},{"given":"Vesselin","family":"Velichkov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The simon and speck lightweight block ciphers. In: Proceedings of the 52nd Annual Design Automation Conference. DAC 2015, Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2744769.2747946","DOI":"10.1145\/2744769.2747946"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Bhargavan, K., Leurent, G.: Transcript collision attacks: breaking authentication in TLS, IKE and SSH. In: NDSS 2016. The Internet Society (2016)","DOI":"10.14722\/ndss.2016.23418"},{"key":"27_CR3","unstructured":"Bogdanov, A., Kavun, E., Paar, C., Rechberger, C., Yalcin, T.: Better than brute-force\u2013optimized hardware architecture for efficient biclique attacks on aes-128. In: ECRYPT Workshop, SHARCS-Special Purpose Hardware for Attacking Cryptographic Systems (2012)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-25385-0_19","volume-title":"Advances in Cryptology - ASIACRYPT 2011","author":"A Bogdanov","year":"2011","unstructured":"Bogdanov, A., Khovratovich, D., Rechberger, C.: Biclique cryptanalysis of the full AES. In: Lee, D.H., Wang, X. (eds.) Advances in Cryptology - ASIACRYPT 2011, pp. 344\u2013371. Springer, Heidelberg (2011)"},{"key":"27_CR5","unstructured":"globalpetrolprices.com: https:\/\/www.globalpetrolprices.com"},{"issue":"11","key":"27_CR6","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1109\/TC.2008.80","volume":"57","author":"T G\u00fcneysu","year":"2008","unstructured":"G\u00fcneysu, T., Kasper, T., Novotn\u1ef3, M., Paar, C., Rupp, A.: Cryptanalysis with COPACOBANA. IEEE Trans. Comput. 57(11), 1498\u20131513 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Hassan, M., Khalid, A., Chattopadhyay, A., Rechberger, C., G\u00fcneysu, T., Paar, C.: New asic\/fpga cost estimates for sha-1 collisions. In: Digital System Design (DSD), 2015 Euromicro Conference on, pp. 669\u2013676. IEEE (2015)","DOI":"10.1109\/DSD.2015.78"},{"key":"27_CR8","unstructured":"Jones, H.: FINFET and FD SOI: market and cost analysis. FDSOI Forum 2018. http:\/\/soiconsortium.eu\/wp-content\/uploads\/2018\/08\/MS-FDSOI9.1818-cr.pdf (2018)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-74143-5_14","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"A Joux","year":"2007","unstructured":"Joux, A., Peyrin, T.: Hash functions and the (amplified) boomerang attack. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 244\u2013263. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_14"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-662-47989-6_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Karpman","year":"2015","unstructured":"Karpman, P., Peyrin, T., Stevens, M.: Practical free-start collision attacks on 76-step SHA-1. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 623\u2013642. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_30"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Khairallah, M., Najm, Z., Chattopadhyay, A., Peyrin, T.: Crack me if you can: Hardware acceleration bridging the gap between practical and theoretical cryptanalysis?: a survey. In: Proceedings of the 18th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation. pp. 167\u2013172. SAMOS 2018, ACM, New York, NY, USA (2018). http:\/\/doi.acm.org\/10.1145\/3229631.3239366","DOI":"10.1145\/3229631.3239366"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/11894063_9","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"S Kumar","year":"2006","unstructured":"Kumar, S., Paar, C., Pelzl, J., Pfeiffer, G., Schimmler, M.: Breaking ciphers with COPACOBANA \u2013a cost-optimized parallel code breaker. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 101\u2013118. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11894063_9"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-030-17659-4_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"G Leurent","year":"2019","unstructured":"Leurent, G., Peyrin, T.: From collisions to chosen-prefix collisions application to full SHA-1. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 527\u2013555. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_18"},{"key":"27_CR14","unstructured":"Leurent, G., Peyrin, T.: Sha-1 is a shambles - first chosen-prefix collision on sha-1 and application to the pgp web of trust. Cryptology ePrint Archive, Report 2020\/014 (2020), https:\/\/eprint.iacr.org\/2020\/014"},{"issue":"143","key":"27_CR15","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte carlo methods for index computation. Math. Comput. 32(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-38348-9_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"M Stevens","year":"2013","unstructured":"Stevens, M.: New collision attacks on SHA-1 based on optimal joint local-collision analysis. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 245\u2013261. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_15"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-319-63688-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"M Stevens","year":"2017","unstructured":"Stevens, M., Bursztein, E., Karpman, P., Albertini, A., Markov, Y.: The first collision for full SHA-1. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 570\u2013596. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_19"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-662-49890-3_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Stevens","year":"2016","unstructured":"Stevens, M., Karpman, P., Peyrin, T.: Freestart collision for full SHA-1. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 459\u2013483. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_18"},{"key":"27_CR19","unstructured":"Brost\u00f6m, T.: Lightweight trusted computing. https:\/\/www.nist.gov\/news-events\/events\/2019\/11\/lightweight-cryptography-workshop-2019 (2019)"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Tu, Y.M., Lu, C.W.: The influence of lot size on production performance in wafer fabrication based on simulation. In: Procedia Engineering, 13th Global Congress on Manufacturing and Management Zhengzhou, China 28\u201330 November, 2016, vol. 174, pp. 135\u2013144 (2017). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877705817301807,","DOI":"10.1016\/j.proeng.2017.01.180"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC Van Oorschot","year":"1999","unstructured":"Van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."},{"key":"27_CR22","unstructured":"Wang, X., Yao, A.C., Yao, F.: Cryptanalysis on sha-1. In: Cryptographic Hash Workshop hosted by NIST (2005)"},{"key":"27_CR23","unstructured":"Wiki, E.: Ethash. GitHub Ethereum Wiki. https:\/\/github.com\/ethereum\/wiki\/wiki\/Ethash (2017)"},{"key":"27_CR24","unstructured":"X16R: https:\/\/en.bitcoinwiki.org\/wiki\/X16R"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75539-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:09:49Z","timestamp":1710263389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75539-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030755386","9783030755393"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75539-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 May 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/site\/ctrsa2021\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","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":"27","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":"27% - 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":"8","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.","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)"}}]}}