{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:12:00Z","timestamp":1787497920281,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540858546","type":"print"},{"value":"9783540858553","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85855-3_18","type":"book-chapter","created":{"date-parts":[[2008,8,28]],"date-time":"2008-08-28T09:27:52Z","timestamp":1219915672000},"page":"263-277","source":"Crossref","is-referenced-by-count":23,"title":["Full Cryptanalysis of LPS and Morgenstern Hash Functions"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Petit","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristin","family":"Lauter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"http:\/\/csrc.nist.gov\/groups\/ST\/hash\/documents\/SHA-3_FR_Notice_Nov02_2007%20-%20more%20readable%20version.pdf"},{"key":"18_CR2","unstructured":"FIPS 180-2 secure hash standard"},{"key":"18_CR3","unstructured":"Charles, D.X., Goren, E.Z., Lauter, K.E.: Cryptographic hash functions from expander graphs. Journal of Cryptology (to appear)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/11761679_11","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S. Contini","year":"2006","unstructured":"Contini, S., Lenstra, A.K., Steinfeld, R.: VSH, an efficient and provable collision-resistant hash function. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 165\u2013182. Springer, Heidelberg (2006)"},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0097-3165(90)90056-3","volume":"53","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P., Soria, M.: Gaussian limiting distributions for the number of components in combinatorial structures. J. Comb. Theory Ser. A\u00a053(2), 165\u2013182 (1990)","journal-title":"J. Comb. Theory Ser. A"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S. Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Amer. Math. Soc.\u00a043, 439\u2013561 (2006)","journal-title":"Bull. Amer. Math. Soc."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08, 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"18_CR8","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: Provably secure FFT hashing. In: NIST 2nd Cryptogaphic Hash Workshop (2006)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M. Morgenstern","year":"1994","unstructured":"Morgenstern, M.: Existence and explicit construction of q\u2009+\u20091 regular Ramanujan graphs for every prime power q. Journal of Combinatorial Theory\u00a0B\u00a062, 44\u201362 (1994)","journal-title":"Journal of Combinatorial Theory\u00a0B"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Petit, C., Lauter, K.E., Quisquater, J.-J.: Full cryptanalysis of LPS and Morgenstern hash functions. Cryptology ePrint Archive, Report 2008\/173 (2008), \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-540-85855-3_18"},{"key":"18_CR11","unstructured":"Petit, C., Lauter, K.E., Quisquater, J.-J.: Cayley hashes: A class of efficient graph-based hash functions (preprint, 2007)"},{"issue":"5","key":"18_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0020-0190(90)90195-4","volume":"33","author":"V. Shoup","year":"1990","unstructured":"Shoup, V.: On the deterministic complexity of factoring polynomials over finite fields. Inf. Process. Lett.\u00a033(5), 261\u2013267 (1990)","journal-title":"Inf. Process. Lett."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48658-5_5","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"J.-P. Tillich","year":"1994","unstructured":"Tillich, J.-P., Z\u00e9mor, G.: Hashing with SL\n                  2. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 40\u201349. Springer, Heidelberg (1994)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., Lobstein, A., Z\u00e9mor, G., Litsyn, S.N. (eds.) Algebraic Coding 1993. LNCS, vol.\u00a0781, pp. 90\u2013110. Springer, Heidelberg (1994)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","first-page":"17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01388652","volume":"4","author":"G. Z\u00e9mor","year":"1994","unstructured":"Z\u00e9mor, G.: Hash functions and Cayley graphs. Des. Codes Cryptography\u00a04(4), 381\u2013394 (1994)","journal-title":"Des. Codes Cryptography"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G. Z\u00e9mor","year":"2008","unstructured":"Z\u00e9mor, G., Tillich, J.-P.: Collisions for the LPS expander graph hash function. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85855-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T23:40:36Z","timestamp":1715298036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85855-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540858546","9783540858553"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85855-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}