{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T23:29:16Z","timestamp":1784676556364,"version":"3.55.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031588679","type":"print"},{"value":"9783031588686","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58868-6_15","type":"book-chapter","created":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T16:01:36Z","timestamp":1714924896000},"page":"381-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Ascon MAC, PRF, and\u00a0Short-Input PRF"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3816-0187","authenticated-orcid":false,"given":"Christoph","family":"Dobraunig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8750-7423","authenticated-orcid":false,"given":"Maria","family":"Eichlseder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8352-9799","authenticated-orcid":false,"given":"Florian","family":"Mendel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-2992-9678","authenticated-orcid":false,"given":"Martin","family":"Schl\u00e4ffer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,6]]},"reference":[{"key":"15_CR1","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions. In: Ecrypt Hash Workshop 2007 (2007). http:\/\/sponge.noekeon.org\/SpongeFunctions.pdf"},{"key":"15_CR2","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Permutation-based encryption, authentication and authenticated encryption. In: DIAC 2012 (2012)"},{"key":"15_CR3","unstructured":"CAESAR committee. CAESAR: Competition for authenticated encryption: security, applicability, and robustness (2014). https:\/\/competitions.cr.yp.to\/caesar-submissions.html"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-662-48800-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"C Dobraunig","year":"2015","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F.: Heuristic tool for linear cryptanalysis with applications to CAESAR candidates. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 490\u2013509. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_20"},{"issue":"S1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"390","DOI":"10.13154\/tosc.v2020.iS1.390-416","volume":"2020","author":"C Dobraunig","year":"2020","unstructured":"Dobraunig, C., et al.: Isap v2.0. IACR Trans. Symmetric Cryptol. 2020(S1), 390\u2013416 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.iS1.390-416","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"15_CR6","unstructured":"Dobraunig, C., et al.: Isap v2.0 (submission to NIST). Finalist of NIST lightweight cryptography standardization process (2021). https:\/\/csrc.nist.gov\/Projects\/Lightweight-Cryptography\/"},{"key":"15_CR7","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1. Submission to the CAESAR competition (2014). https:\/\/ascon.iaik.tugraz.at"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Cryptanalysis of Ascon. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 371\u2013387. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_20. arXiv:2015\/030","DOI":"10.1007\/978-3-319-16715-2_20"},{"key":"15_CR9","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1.2. Submission to Round 3 of the CAESAR competition (2016). https:\/\/ascon.iaik.tugraz.at"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00145-021-09398-9","volume":"34","author":"C Dobraunig","year":"2021","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1.2: lightweight authenticated encryption and hashing. J. Cryptol. 34(3), 33 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09398-9","journal-title":"J. Cryptol."},{"key":"15_CR11","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1.2 (Submission to NIST). Finalist of NIST lightweight cryptography standardization process (2021). https:\/\/csrc.nist.gov\/Projects\/Lightweight-Cryptography\/"},{"key":"15_CR12","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Status update on Ascon v1.2. Technical report (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/lightweight-cryptography\/documents\/finalist-round\/status-updates\/ascon-update.pdf"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Daemen, J., Mennink, B., Van Assche, G.: Full-state keyed duplex with built-in multi-user support. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 606\u2013637. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_21. arXiv:2017\/498","DOI":"10.1007\/978-3-319-70697-9_21"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"64","DOI":"10.46586\/tosc.v2022.i1.64-87","volume":"2022","author":"J Erlacher","year":"2022","unstructured":"Erlacher, J., Mendel, F., Eichlseder, M.: Bounds for the security of Ascon against differential and linear cryptanalysis. IACR Trans. Symmetric Cryptol. 2022(1), 64\u201387 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i1.64-87","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"El Hirch, S., Mella, S., Mehrdad, A., Daemen, J.: Improved differential and linear trail bounds for ASCON. IACR Trans. Symmetric Cryptol. 2022(4), 145\u2013178 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i4.145-178. arXiv:2022\/1377","DOI":"10.46586\/tosc.v2022.i4.145-178"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-662-46706-0_24","volume-title":"Fast Software Encryption","author":"M Eichlseder","year":"2015","unstructured":"Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Branching heuristics in differential collision search with applications to SHA-512. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 473\u2013488. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_24"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-981-99-8727-6_14","volume-title":"ASIACRYPT 2023","author":"K Hu","year":"2023","unstructured":"Hu, K., Peyrin, T., Tan, Q.Q., Yap, T.: Revisiting higher-order differential-linear attacks from an algebraic perspective. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14440, pp. 405\u2013435. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8727-6_14"},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Li, Z., Dong, X., Wang, X.: Conditional cube attack on round-reduced ASCON. IACR Trans. Symmetric Cryptol. 2017(1), 175\u2013202 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.175-202. arXiv:2017\/160","DOI":"10.13154\/tosc.v2017.i1.175-202"},{"issue":"3","key":"15_CR19","doi-asserted-by":"publisher","first-page":"38102","DOI":"10.1007\/s11432-016-0283-3","volume":"60","author":"Y Li","year":"2017","unstructured":"Li, Y., Zhang, G., Wang, W., Wang, M.: Cryptanalysis of round-reduced ASCON. Sci. China Inf. Sci. 60(3), 38102 (2017). https:\/\/doi.org\/10.1007\/s11432-016-0283-3","journal-title":"Sci. China Inf. Sci."},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.46586\/tosc.v2023.i2.1-46","volume":"2023","author":"B Mennink","year":"2023","unstructured":"Mennink, B.: Understanding the duplex and its security. IACR Trans. Symmetric Cryptol. 2023(2), 1\u201346 (2023). https:\/\/doi.org\/10.46586\/tosc.v2023.i2.1-46","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-25385-0_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"F Mendel","year":"2011","unstructured":"Mendel, F., Nad, T., Schl\u00e4ffer, M.: Finding SHA-2 characteristics: searching through a minefield of contradictions. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 288\u2013307. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_16"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-38348-9_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"F Mendel","year":"2013","unstructured":"Mendel, F., Nad, T., Schl\u00e4ffer, M.: Improving local collisions: new attacks on reduced SHA-256. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 262\u2013278. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_16"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-662-48800-3_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"B Mennink","year":"2015","unstructured":"Mennink, B., Reyhanitabar, R., Viz\u00e1r, D.: Security of full-state keyed sponge and duplex: applications to authenticated encryption. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 465\u2013489. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_19"},{"key":"15_CR24","unstructured":"Mattsson, J.P., Selander, G., Paavolainen, S., Karako\u00e7, F., Tiloca, M., Moskowitz, R.: Proposals for standardization of the Ascon family. In: Sixth Lightweight Cryptography Workshop (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Events\/2023\/lightweight-cryptography-workshop-2023\/documents\/accepted-papers\/03-proposals-for-standardization-of-ascon-family.pdf"},{"key":"15_CR25","unstructured":"National Institute of Standards and Technology. Submission requirements and evaluation criteria for the lightweight cryptography standardization process (2018). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Lightweight-Cryptography\/documents\/final-lwc-submission-requirements-august2018.pdf"},{"key":"15_CR26","unstructured":"NIST Lightweight Cryptography Team. Lightweight cryptography standardization process: NIST selects Ascon (2023). https:\/\/csrc.nist.gov\/News\/2023\/lightweight-cryptography-nist-selects-ascon"},{"issue":"1","key":"15_CR27","doi-asserted-by":"publisher","first-page":"130","DOI":"10.46586\/tosc.v2021.i1.130-155","volume":"2021","author":"R Rohit","year":"2021","unstructured":"Rohit, R., Hu, K., Sarkar, S., Sun, S.: Misuse-free key-recovery and distinguishing attacks on 7-round Ascon. IACR Trans. Symmetric Cryptol. 2021(1), 130\u2013155 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i1.130-155","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11761679_23","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"P Rogaway","year":"2006","unstructured":"Rogaway, P., Shrimpton, T.: A provable-security treatment of the key-wrap problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 373\u2013390. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_23"},{"issue":"4","key":"15_CR29","doi-asserted-by":"publisher","first-page":"74","DOI":"10.46586\/tosc.v2021.i4.74-99","volume":"2021","author":"R Rohit","year":"2021","unstructured":"Rohit, R., Sarkar, S.: Diving deep into the weak keys of round reduced Ascon. IACR Trans. Symmetric Cryptol. 2021(4), 74\u201399 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i4.74-99","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"15_CR30","unstructured":"Tezcan, C.: Analysis of Ascon, DryGASCON, and Shamash permutations. Int. J. Inf. Secur. Sci. 9(3), 172\u2013187 (2020). arXiv:2020\/1458"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58868-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T16:02:29Z","timestamp":1714924949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58868-6_15"}},"subtitle":["Lightweight, Fast, and Efficient Pseudorandom Functions"],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031588679","9783031588686"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58868-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 May 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ct-rsa-2024.aau.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}