{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:46:00Z","timestamp":1742928360575,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031853623"},{"type":"electronic","value":"9783031853630"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-85363-0_43","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T08:51:56Z","timestamp":1741078316000},"page":"706-718","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cayley Hashing with\u00a0Cookies"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Shpilrain","sequence":"first","affiliation":[]},{"given":"Bianca","family":"Sosnovski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-69710-1_7","volume-title":"Fast Software Encryption","author":"KS Abdukhalikov","year":"1998","unstructured":"Abdukhalikov, K.S., Kim, C.: On the security of the hashing scheme based on $$SL_{2}$$. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol. 1372, pp. 93\u2013102. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69710-1_7"},{"key":"43_CR2","first-page":"53","volume":"3","author":"Y Aikawa","year":"2023","unstructured":"Aikawa, Y., Jo, H., Satake, S.: Left-right Cayley hashing: a new framework for provably secure hash functions. Math. Cryptol. 3, 53\u201365 (2023)","journal-title":"Math. Cryptol."},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s10801-022-01128-z","volume":"56","author":"G Arzhantseva","year":"2022","unstructured":"Arzhantseva, G., Biswas, A.: Logarithmic girth expander graphs of $$SL_n(\\mathbb{F} _p)$$. J. Algebraic Comb. 56, 691\u2013723 (2022)","journal-title":"J. Algebraic Comb."},{"issue":"26","key":"43_CR4","first-page":"811","volume":"13","author":"AL Basdevant","year":"2008","unstructured":"Basdevant, A.L., Singh, A.: Rate of growth of a transient cookie random walk. Electron. J. Probab. 13(26), 811\u2013851 (2008)","journal-title":"Electron. J. Probab."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Bourgain, J., Gamburd, A.: Uniform expansion bounds for Cayley graphs of $$SL_2(\\mathbb{F}_p)$$. Ann. Math. (2) 167, 625\u2013642 (2008)","DOI":"10.4007\/annals.2008.167.625"},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/s00233-015-9766-5","volume":"94","author":"L Bromberg","year":"2017","unstructured":"Bromberg, L., Shpilrain, V., Vdovina, A.: Navigating in the Cayley graph of $$SL_2(\\mathbb{F} _p)$$ and applications to hashing. Semigroup Forum 94, 314\u2013324 (2017)","journal-title":"Semigroup Forum"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.jalgebra.2017.01.036","volume":"478","author":"A Chorna","year":"2017","unstructured":"Chorna, A., Geller, K., Shpilrain, V.: On two-generator subgroups of $$SL_2(\\mathbb{Z} )$$, $$SL_2(\\mathbb{Q} )$$, and $$SL_2(\\mathbb{R} )$$. J. Algebra 478, 367\u2013381 (2017)","journal-title":"J. Algebra"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/s00145-010-9063-0","volume":"24","author":"M Grassl","year":"2011","unstructured":"Grassl, M., Ili\u0107, I., Magliveras, S., Steinwandt, R.: Cryptanalysis of the Tillich-Z\u00e9mor hash function. J. Cryptolgy 24, 148\u2013156 (2011)","journal-title":"J. Cryptolgy"},{"key":"43_CR9","unstructured":"Han, S., Masuda, A.M., Singh, S., Thiel, J.: Maximal entries of elements in certain matrix monoids. Integers 20, Paper No. A31 (2020)"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Helfgott, H.A.: Growth and generation in $$SL_2(\\mathbb{Z}\/p\\mathbb{Z}$$). Ann. Math. (2) 167, 601\u2013623 (2008)","DOI":"10.4007\/annals.2008.167.601"},{"key":"43_CR11","first-page":"338","volume":"2","author":"KT Joju","year":"2012","unstructured":"Joju, K.T.: Tillich-Zemor hash function with new generators and analysis. Int. Res. J. Pure Algebra 2, 338\u2013343 (2012)","journal-title":"Int. Res. J. Pure Algebra"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1155\/S1073792803130383","volume":"27","author":"M Larsen","year":"2003","unstructured":"Larsen, M.: Navigating the Cayley graph of $$SL_2(\\mathbb{F} _p)$$. Int. Math. Res. Notes 27, 1465\u20131471 (2003)","journal-title":"Int. Math. Res. Notes"},{"key":"43_CR13","unstructured":"Le Coz, C., Battarbee, C., Flores, R., Koberda, T., Kahrobaei, D.: Post-quantum hash functions using $$SL_n(\\mathbb{F}_p)$$, arxiv:2207.03987"},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10623-015-0129-8","volume":"81","author":"C Mullan","year":"2016","unstructured":"Mullan, C., Tsaban, B.: $$SL_2$$ homomorphic hash functions: worst case to average case reduction and short collision search. Des. Codes Cryptogr. 81, 83\u2013107 (2016)","journal-title":"Des. Codes Cryptogr."},{"key":"43_CR15","unstructured":"National Institute of Standards and Technology - NIST. NIST Statistical Test Suite (2010). http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/rng\/documentation_software.html"},{"key":"43_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-19574-7_20","volume-title":"Selected Areas in Cryptography","author":"C Petit","year":"2011","unstructured":"Petit, C., Quisquater, J.-J.: Preimages for the Tillich-Z\u00e9mor hash function. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 282\u2013301. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_20"},{"key":"43_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-00862-7_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"C Petit","year":"2009","unstructured":"Petit, C., Quisquater, J.-J., Tillich, J.-P., Z\u00e9mor, G.: Hard and easy components of collision search in the Z\u00e9mor-Tillich hash function: new attacks and reduced variants with equivalent security. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 182\u2013194. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_12"},{"key":"43_CR18","unstructured":"Rukhin, A., et al.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST Special Publication (2010)"},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1515\/gcc-2016-0016","volume":"8","author":"V Shpilrain","year":"2016","unstructured":"Shpilrain, V., Sosnovski, B.: Compositions of linear functions and applications to hashing. Groups Complex. Cryptol. 8, 155\u2013161 (2016)","journal-title":"Groups Complex. Cryptol."},{"issue":"1","key":"43_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/aop\/1176996444","volume":"3","author":"F Solomon","year":"1975","unstructured":"Solomon, F.: Random walks in a random environment. Ann. Probab. 3(1), 1\u201331 (1975)","journal-title":"Ann. Probab."},{"key":"43_CR21","unstructured":"Stein, W.A., et al.: SageMath, the Sage Mathematics Software System (Version 10.2). The Sage Developers (2023). https:\/\/www.sagemath.org"},{"key":"43_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-57843-9_12","volume-title":"Algebraic Coding","author":"J-P Tillich","year":"1994","unstructured":"Tillich, J.-P., Z\u00e9mor, G.: Group-theoretic hash functions. In: Cohen, G., Litsyn, S., Lobstein, A., Z\u00e9mor, G. (eds.) Algebraic Coding 1993. LNCS, vol. 781, pp. 90\u2013110. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57843-9_12"},{"key":"43_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-48658-5_5","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"J-P Tillich","year":"1994","unstructured":"Tillich, J.-P., Z\u00e9mor, G.: Hashing with $$SL_{2}$$. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 40\u201349. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_5"},{"key":"43_CR24","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1515\/jmc-2019-0033","volume":"14","author":"H Tomkins","year":"2020","unstructured":"Tomkins, H., Nevins, M., Salmasian, H.: New Z\u00e9mor-Tillich type hash functions over $$GL_2(\\mathbb{F} _{p^n})$$. J. Math. Cryptology 14, 236\u2013253 (2020)","journal-title":"J. Math. Cryptology"},{"key":"43_CR25","unstructured":"Wikipedia, Cryptographic hash function. https:\/\/en.wikipedia.org\/wiki\/Cryptographic_hash_function"},{"key":"43_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/3-540-46416-6_44","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"G Z\u00e9mor","year":"1991","unstructured":"Z\u00e9mor, G.: Hash functions and graphs with large girths. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 508\u2013511. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_44"}],"container-title":["Lecture Notes in Networks and Systems","Advances in Information and Communication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-85363-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T08:52:01Z","timestamp":1741078321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-85363-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031853623","9783031853630"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-85363-0_43","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FICC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Future of Information and Communication Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ficc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/saiconference.com\/FICC","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}