{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:21:36Z","timestamp":1740158496268,"version":"3.37.3"},"reference-count":28,"publisher":"Walter de Gruyter GmbH","issue":"2","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1117675"],"award-info":[{"award-number":["CNS-1117675"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141210758"],"award-info":[{"award-number":["N000141210758"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Cayley hash functions are based on a simple idea of using a pair of (semi)group elements,<\/jats:p>","DOI":"10.1515\/gcc-2016-0016","type":"journal-article","created":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T10:01:57Z","timestamp":1477994517000},"source":"Crossref","is-referenced-by-count":4,"title":["Compositions of linear functions and applications to hashing"],"prefix":"10.1515","volume":"8","author":[{"given":"Vladimir","family":"Shpilrain","sequence":"first","affiliation":[]},{"given":"Bianca","family":"Sosnovski","sequence":"additional","affiliation":[]}],"member":"374","reference":[{"key":"ref71","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10623-015-0129-8","article-title":"SL2${\\mathrm{SL}_{2}}$ homomorphic hash functions: Worst case to average case reduction and short collision search","volume":"81","year":"2016","journal-title":"Des. Codes Cryptogr."},{"key":"ref101","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1090\/noti1001","article-title":"Rubik\u2019s for cryptographers","volume":"60","year":"2013","journal-title":"Notices Amer. Math. Soc."},{"journal-title":"Crypto++ 5.6.0 benchmarks","key":"ref41"},{"key":"ref241","first-page":"282","article-title":"Preimages for the Tillich\u2013Z\u00e9mor hash function","year":"2010","journal-title":"Selected Areas in Cryptography"},{"journal-title":"A statistical test suite for random and pseudorandom number generators for cryptographic applications","year":"2010","key":"ref111"},{"key":"ref181","first-page":"165","article-title":"VSH, an efficient and provable collision-resistant hash function","year":"2006","journal-title":"Advances in Cryptology \u2013 EUROCRYPT 2006"},{"key":"ref221","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10623-015-0129-8","article-title":"SL2${\\mathrm{SL}_{2}}$ homomorphic hash functions: Worst case to average case reduction and short collision search","volume":"81","year":"2016","journal-title":"Des. Codes Cryptogr."},{"key":"ref131","first-page":"40","article-title":"Hashing with SL2${\\mathrm{SL}_{2}}$","year":"1994","journal-title":"Advances in cryptology \u2013 CRYPTO \u201994"},{"journal-title":"A statistical test suite for random and pseudorandom number generators for cryptographic applications","year":"2010","key":"ref261"},{"key":"ref281","first-page":"40","article-title":"Hashing with SL2${\\mathrm{SL}_{2}}$","year":"1994","journal-title":"Advances in cryptology \u2013 CRYPTO \u201994"},{"journal-title":"The primes pages","key":"ref11"},{"key":"ref121","first-page":"90","article-title":"Group-theoretic hash functions","year":"1993","journal-title":"Proceedings of the First French\u2013Israeli Workshop on Algebraic Coding"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1142\/S0218196799000199","article-title":"On the undecidability of freeness of matrix semigroups","volume":"9","year":"1999","journal-title":"Internat. J. Algebra Comput."},{"key":"ref31","first-page":"165","article-title":"VSH, an efficient and provable collision-resistant hash function","year":"2006","journal-title":"Advances in Cryptology \u2013 EUROCRYPT 2006"},{"key":"ref91","first-page":"282","article-title":"Preimages for the Tillich\u2013Z\u00e9mor hash function","year":"2010","journal-title":"Selected Areas in Cryptography"},{"author":"NIST","key":"ref141","article-title":"National Institute of Standards and Technology Statistical Test Suite http csrc nist gov groups ST toolkit rng documentation software html"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/s00145-010-9063-0","article-title":"Cryptanalysis of the Tillich\u2013Z\u00e9mor hash function","volume":"24","year":"2011","journal-title":"J. Cryptology"},{"journal-title":"Crypto++ 5.6.0 benchmarks","key":"ref191"},{"journal-title":"On graph-based cryptographic hash functions","year":"2009","key":"ref81"},{"key":"ref201","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/s00145-010-9063-0","article-title":"Cryptanalysis of the Tillich\u2013Z\u00e9mor hash function","volume":"24","year":"2011","journal-title":"J. Cryptology"},{"journal-title":"Handbook of Applied Cryptography","year":"1997","key":"ref211"},{"journal-title":"On graph-based cryptographic hash functions","year":"2009","key":"ref231"},{"key":"ref271","first-page":"90","article-title":"Group-theoretic hash functions","year":"1993","journal-title":"Proceedings of the First French\u2013Israeli Workshop on Algebraic Coding"},{"key":"ref171","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1142\/S0218196799000199","article-title":"On the undecidability of freeness of matrix semigroups","volume":"9","year":"1999","journal-title":"Internat. J. Algebra Comput."},{"key":"ref251","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1090\/noti1001","article-title":"Rubik\u2019s for cryptographers","volume":"60","year":"2013","journal-title":"Notices Amer. Math. Soc."},{"author":"NIST","key":"ref291","article-title":"National Institute of Standards and Technology Statistical Test Suite http csrc nist gov groups ST toolkit rng documentation software html"},{"journal-title":"Handbook of Applied Cryptography","year":"1997","key":"ref61"},{"journal-title":"The primes pages","key":"ref161"}],"container-title":["Groups Complexity Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/gcc.2016.8.issue-2\/gcc-2016-0016\/gcc-2016-0016.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/view\/j\/gcc.2016.8.issue-2\/gcc-2016-0016\/gcc-2016-0016.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T03:08:40Z","timestamp":1614395320000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/gcc-2016-0016\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,1]]},"references-count":28,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1515\/gcc-2016-0016","relation":{},"ISSN":["1867-1144","1869-6104"],"issn-type":[{"type":"print","value":"1867-1144"},{"type":"electronic","value":"1869-6104"}],"subject":[],"published":{"date-parts":[[2016,1,1]]}}}