{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:39Z","timestamp":1772893059284,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031533679","type":"print"},{"value":"9783031533686","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-53368-6_2","type":"book-chapter","created":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:02:15Z","timestamp":1708282935000},"page":"22-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Closer Look at\u00a0the\u00a0S-Box: Deeper Analysis of\u00a0Round-Reduced ASCON-HASH"],"prefix":"10.1007","author":[{"given":"Xiaorui","family":"Yu","sequence":"first","affiliation":[]},{"given":"Fukang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Gaoli","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Siwei","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Willi","family":"Meier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"2_CR1","unstructured":"The CAESAR committee, CAESAR: competition for authenticated encryption: security, applicability, and robustness (2014). https:\/\/competitions.cr.yp.to\/caesar-submissions.html"},{"key":"2_CR2","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions. In: ECRYPT Hash Workshop, no. 9 (2007)"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Bouillaguet, C., Delaplace, C., Trimoska, M.: A simple deterministic algorithm for systems of quadratic polynomials over F$${}_{\\text{2}}$$. In: Bringmann, K., Chan, T. (eds.) 5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, 10\u201311 January 2022, pp. 285\u2013296. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977066.22","DOI":"10.1137\/1.9781611977066.22"},{"key":"2_CR4","unstructured":"Bovy, E., Daemen, J., Mennink, B.: Comparison of the second round candidates of the NIST lightweight cryptography competition. Bachelor thesis, Radboud University (2020)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-642-34047-5_25","volume-title":"Fast Software Encryption","author":"I Dinur","year":"2012","unstructured":"Dinur, I., Dunkelman, O., Shamir, A.: New attacks on Keccak-224 and Keccak-256. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 442\u2013461. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_25"},{"key":"2_CR6","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: ASCON v1. Submission to round 1 of the CAESAR competition (2014). https:\/\/competitions.cr.yp.to\/round1\/Asconv1.pdf"},{"key":"2_CR7","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: ASCON v1.1. Submission to round 2 of the CAESAR competition (2015). https:\/\/competitions.cr.yp.to\/round2\/Asconv11.pdf"},{"key":"2_CR8","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1.2. Submission to round 1 of the NIST lightweight cryptography project (2019). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Lightweight-Cryptography\/documents\/round-1\/spec-doc\/Ascon-spec.pdf"},{"key":"2_CR9","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Status update on ASCON v1. 2 (2020)"},{"key":"2_CR10","doi-asserted-by":"publisher","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","DOI":"10.1007\/s00145-021-09398-9"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1145\/321420.321422","volume":"14","author":"RW Floyd","year":"1967","unstructured":"Floyd, R.W.: Nondeterministic algorithms. J. ACM 14(4), 636\u2013644 (1967). https:\/\/doi.org\/10.1145\/321420.321422","journal-title":"J. ACM"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.46586\/tosc.v2021.i3.102-136","volume":"2021","author":"D G\u00e9rault","year":"2021","unstructured":"G\u00e9rault, D., Peyrin, T., Tan, Q.Q.: Exploring differential-based distinguishers and forgeries for ASCON. IACR Trans. Symmetric Cryptol. 2021(3), 102\u2013136 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i3.102-136","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-030-56877-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"F Liu","year":"2020","unstructured":"Liu, F., Isobe, T., Meier, W.: Automatic verification of differential characteristics: application to reduced GIMLI. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 219\u2013248. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_8"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-030-84252-9_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"F Liu","year":"2021","unstructured":"Liu, F., Isobe, T., Meier, W.: Cryptanalysis of full LowMC and LowMC-M with algebraic techniques. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part III. LNCS, vol. 12827, pp. 368\u2013401. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_13"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-030-90567-5_5","volume-title":"Information Security and Privacy","author":"F Liu","year":"2021","unstructured":"Liu, F., Isobe, T., Meier, W., Yang, Z.: Algebraic attacks on round-reduced Keccak. In: Baek, J., Ruj, S. (eds.) ACISP 2021. LNCS, vol. 13083, pp. 91\u2013110. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90567-5_5"},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"102","DOI":"10.46586\/tosc.v2022.i3.102-122","volume":"2022","author":"F Liu","year":"2022","unstructured":"Liu, F., Meier, W., Sarkar, S., Isobe, T.: New low-memory algebraic attacks on LowMC in the picnic setting. IACR Trans. Symmetric Cryptol. 2022(3), 102\u2013122 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.102-122","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-031-22963-3_8","volume-title":"Advances in Cryptology - ASIACRYPT 2022","author":"F Liu","year":"2022","unstructured":"Liu, F., Sarkar, S., Wang, G., Meier, W., Isobe, T.: Algebraic meet-in-the-middle attack on LowMC. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part I. LNCS, vol. 13791, pp. 225\u2013255. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_8"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-319-56617-7_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"K Qiao","year":"2017","unstructured":"Qiao, K., Song, L., Liu, M., Guo, J.: New collision attacks on round-reduced Keccak. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part III. LNCS, vol. 10212, pp. 216\u2013243. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_8"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Qin, L., Zhao, B., Hua, J., Dong, X., Wang, X.: Weak-diffusion structure: meet-in-the-middle attacks on sponge-based hashing revisited. Cryptology ePrint Archive, Paper 2023\/518 (2023). https:\/\/eprint.iacr.org\/2023\/518","DOI":"10.1007\/978-3-031-30634-1_6"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-63715-0_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"L Song","year":"2017","unstructured":"Song, L., Liao, G., Guo, J.: Non-full Sbox linearization: applications to collision attacks on round-reduced Keccak. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 428\u2013451. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_15"},{"key":"2_CR21","unstructured":"Zong, R., Dong, X., Wang, X.: Collision attacks on round-reduced GIMLI-HASH\/ASCON-XOF\/ASCON-HASH. Cryptology ePrint Archive, Paper 2019\/1115 (2019). https:\/\/eprint.iacr.org\/2019\/1115"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53368-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:02:42Z","timestamp":1708282962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53368-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031533679","9783031533686"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53368-6_2","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":"19 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fredericton, NB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sac-workshop.github.io\/sac-2023\/index.html","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":"45","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":"21","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":"47% - 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.09","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.56","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)"}}]}}