{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:18:47Z","timestamp":1725488327162},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48071-4_43","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:23:49Z","timestamp":1186363429000},"page":"587-593","source":"Crossref","is-referenced-by-count":4,"title":["FFT-Hash-II is not yet Collision-free"],"prefix":"10.1007","author":[{"given":"Serge","family":"Vaudenay","sequence":"first","affiliation":[]}],"member":"297","reference":[{"unstructured":"C. P. Schnorr. FFT-Hashing: An Efficient Cryptographic Hash Function. Presented at the rump session ot the CRYPTO\u201991 Conference (unpublished)","key":"43_CR1"},{"unstructured":"C. P. Schnorr. FFT-Hash II, Efficient Cryptographic Hashing. Presented at the EUROCRYPT\u201992 Conference (unpublished)","key":"43_CR2"},{"unstructured":"T. Baritaud, H. Gilbert, M. Girault. FFT Hashing is not Collision-free. Presented at the EUROCRYPT\u201992 Conference (unpublished)","key":"43_CR3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48071-4_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:22Z","timestamp":1605647722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48071-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540573401"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/3-540-48071-4_43","relation":{},"subject":[]}}