{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T23:13:19Z","timestamp":1771629199253,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,12,31]],"date-time":"2009-12-31T00:00:00Z","timestamp":1262217600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10207-009-0100-7","type":"journal-article","created":{"date-parts":[[2009,12,30]],"date-time":"2009-12-30T15:18:39Z","timestamp":1262186319000},"page":"137-151","source":"Crossref","is-referenced-by-count":17,"title":["On hash functions using checksums"],"prefix":"10.1007","volume":"9","author":[{"given":"Praveen","family":"Gauravaram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Kelsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars R.","family":"Knudsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f8ren S.","family":"Thomsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,31]]},"reference":[{"key":"100_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micciancio, D.: A new paradigm for collision-free hashing: incrementality at reduced cost. In: Fumy, W. (ed.) Advances in Cryptology\u2014EUROCRYPT\u201997, Proceedings, Lecture Notes in Computer Science, Vol. 1233, pp. 163\u2013192 (1997)","DOI":"10.1007\/3-540-69053-0_13"},{"key":"100_CR2","unstructured":"Coppersmith, D.: Two broken hash functions. IBM research report RC 18397, IBM T. J. Watson Research Center, Yorktown Heights, N.Y., 10598, USA, October (1992)"},{"key":"100_CR3","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.: A design principle for hash functions. In: Brassard, G. (ed.) Advances in Cryptology\u2014CRYPTO \u201989, Proceedings, Lecture Notes in Computer Science, vol. 435\u00a0pp. 416\u2013427. Springer (1990)","DOI":"10.1007\/0-387-34805-0_39"},{"key":"100_CR4","unstructured":"Dean, R.D.: Formal aspects of mobile code security. PhD thesis, Princeton University, January (1999)"},{"key":"100_CR5","unstructured":"Dunkelman, O., Preneel, B.: Generalizing the herding attack to concatenated hashing schemes. Presented at ECRYPT hash function workshop, May 24\u201325, 2007, Barcelona, Spain. Available: http:\/\/events.iaik.tugraz.at\/HashWorkshop07\/program.html (2009\/11\/27)"},{"key":"100_CR6","unstructured":"Filho, D., Barreto, P., Rijmen, V.: The MAELSTROM-0 hash function. Published at 6th Brazilian Symposium on Information and Computer System Security (2006)"},{"key":"100_CR7","first-page":"36","volume-title":"Topics in Cryptology\u2014CT-RSA 2008, Lecture Notes in Computer Science, vol. 4964","author":"P. Gauravaram","year":"2008","unstructured":"Gauravaram P., Kelsey J.: Linear-XOR and additive checksums don\u2019t protect Damg\u00e5rd-Merkle hashes from generic attacks. In: Malkin, T. (eds) Topics in Cryptology\u2014CT-RSA 2008, Lecture Notes in Computer Science, vol. 4964, pp. 36\u201351. Springer, Berlin (2008)"},{"key":"100_CR8","doi-asserted-by":"crossref","unstructured":"Gauravaram, P., Millan, W., Dawson, E., Viswanathan, K.: Constructing secure hash functions by enhancing Merkle-Damg\u00e5rd construction. In: Batten, L.M., R. Safavi-Naini, L.M. (eds.) Australasian Conference on Information Security and Privacy 2006, Proceedings, Lecture Notes in Computer Science, vol. 4058, pp. 407\u2013420. Springer (2006) The full version of this paper is available at http:\/\/www.isi.qut.edu.au\/research\/publications\/technical\/qut-isi-tr-2006-013.pdf . (Accessed on 2009\/11\/27)","DOI":"10.1007\/11780656_34"},{"key":"100_CR9","doi-asserted-by":"crossref","unstructured":"Gazzoni Filho, D.L., Barreto, P.S.L.M., Rijmen, V.: The maelstrom-0 hash function. Published at 6th Brazilian Symposium on Information and Computer System Security, August 28\u2013September 1, Santos, Brazil (2006)","DOI":"10.5753\/sbseg.2006.20936"},{"key":"100_CR10","first-page":"179","volume-title":"Fast Software Encryption 2006, Lecture Notes in Computer Science, vol. 4047","author":"J. Hoch","year":"2006","unstructured":"Hoch J., Shamir A.: Breaking the ICE: finding multicollisions in iterated concatenated and expanded (ICE) hash functions. In: Robshaw, M. (eds) Fast Software Encryption 2006, Lecture Notes in Computer Science, vol. 4047, pp. 179\u2013194. Springer, Berlin (2006)"},{"key":"100_CR11","doi-asserted-by":"crossref","unstructured":"Joux, A.: Multicollisions in iterated hash functions. Application to cascaded constructions. In: Franklin, M.K. (ed.) Advances in Cryptology\u2014CRYPTO 2004, Proceedings, Lecture Notes in Computer Science, vol. 3152, pp 306\u2013316. Springer (2004)","DOI":"10.1007\/978-3-540-28628-8_19"},{"key":"100_CR12","doi-asserted-by":"crossref","unstructured":"Kaliski B.S. Jr.: The MD2 message-digest algorithm, April 1992. RFC 1319. Available: http:\/\/www.ietf.org\/rfc\/rfc1319.txt (2009\/11\/27) (1992)","DOI":"10.17487\/rfc1319"},{"key":"100_CR13","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Kohno, T.: Herding hash functions and the nostradamus attack. In: Vaudenay, S. (ed.) Advances in Cryptology\u2014EUROCRYPT 2006, Proceedings, Lecture Notes in Computer Science, vol. 4004, pp. 183\u2013200. Springer (2006)","DOI":"10.1007\/11761679_12"},{"key":"100_CR14","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B.: Second preimages on n-bit hash functions for much less than 2 n work. In: Cramer, R. (ed.) Advances in Cryptology\u2014EUROCRYPT 2005, Proceedings, Lecture Notes in Computer Science, vol. 3494, pp. 474\u2013490. Springer (2005)","DOI":"10.1007\/11426639_28"},{"key":"100_CR15","doi-asserted-by":"crossref","unstructured":"Knudsen, L.R., Mathiassen J.E.: Preimage and Collision Attacks on MD2. In: Gilbert, H., Handschuh, H. (eds.) Fast Software Encryption 2005, Proceedings, volume 3557 of Lecture Notes in Computer Science, pp. 255\u2013267. Springer (2005)","DOI":"10.1007\/11502760_17"},{"key":"100_CR16","doi-asserted-by":"crossref","unstructured":"Knudsen, L.R., Mathiassen, J.E., Muller, F., Thomsen S.S.: Cryptanalysis of MD2. (2009). doi: 10.1007\/s00145-009-9054-1","DOI":"10.1007\/s00145-009-9054-1"},{"key":"100_CR17","doi-asserted-by":"crossref","unstructured":"Lai, X., Massey, J.L.: Hash functions based on block ciphers. In: Rueppel, R.A. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201992, Proceedings, Lecture Notes in Computer Science, vol. 658, pp. 55\u201370. Springer (1993)","DOI":"10.1007\/3-540-47555-9_5"},{"key":"100_CR18","unstructured":"Lei, D.: F-HASH: securing hash functions using feistel chaining. Cryptology ePrint Archive, Report 2005\/430, Available: http:\/\/eprint.iacr.org\/2005\/430.pdf (2009\/11\/27) (2005)"},{"key":"100_CR19","doi-asserted-by":"crossref","unstructured":"Lucks, S.: A failure-friendly design principle for hash functions. In: Roy, B.K. (ed.) Advances in Cryptology\u2014ASIACRYPT 2005, Proceedings, Lecture Notes in Computer Science, vol. 3788, pp. 474\u2013494. Springer (2005)","DOI":"10.1007\/11593447_26"},{"key":"100_CR20","doi-asserted-by":"crossref","unstructured":"Mendel, F., Pramstaller, N., Rechberger, C., Kontak, M., Szmidt, J.: Cryptanalysis of the GOST hash function. In: Wagner, D. (ed.) Advances in Cryptology\u2014CRYPTO 2008, Proceedings, Lecture Notes in Computer Science, vol. 5157, pp. 162\u2013178. Springer (2008)","DOI":"10.1007\/978-3-540-85174-5_10"},{"key":"100_CR21","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) Advances in Cryptology\u2014CRYPTO\u201989, Proceedings, Lecture Notes in Computer Science, vol. 435, pp. 428\u2013446. Springer (1990)","DOI":"10.1007\/0-387-34805-0_40"},{"key":"100_CR22","doi-asserted-by":"crossref","unstructured":"Muller, F.: The MD2 hash function is not one-way. In: Lee, P.J. (ed.) Advances in cryptology\u2014ASIACRYPT 2004, Proceedings, Lecture Notes in Computer Science vol. 3329, pp. 214\u2013229. Springer (2004)","DOI":"10.1007\/978-3-540-30539-2_16"},{"issue":"2","key":"100_CR23","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1109\/TIT.2006.889721","volume":"53","author":"M. Nandi","year":"2007","unstructured":"Nandi M., Stinson D.: Multicollision attacks on some generalized sequential hash functions. IEEE Trans. Inf. Theory 53(2), 759\u2013767 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"100_CR24","unstructured":"National Institute of Standards and Technology: FIPS PUB 180-1, Secure Hash Standard, (17 April 1995)"},{"key":"100_CR25","unstructured":"National Institute of Standards and Technology: FIPS PUB 180-2, Secure Hash Standard, (1 August 2002)"},{"key":"100_CR26","unstructured":"National Institute of Standards and Technology: FIPS PUB 180-3, Secure Hash Standard, (June 2007)"},{"key":"100_CR27","unstructured":"Preneel, B.: Analysis and design of cryptographic hash functions. PhD thesis, Katholieke Universiteit Leuven, (February 1993)"},{"key":"100_CR28","doi-asserted-by":"crossref","unstructured":"Quisquater, J.-J., Girault, M.: 2n-Bit hash-functions using n-bit symmetric block cipher algorithms. In: Quisquater, J.-J., Vandewalle, J. (eds.) Advances in Cryptology\u2014EUROCRYPT \u201989, Proceedings, Lecture Notes in Computer Science, vol. 434, pp. 102\u2013109. Springer (1990)","DOI":"10.1007\/3-540-46885-4_13"},{"key":"100_CR29","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: The MD5 message-digest algorithm, April 1992. RFC 1321. Available: http:\/\/www.ietf.org\/rfc\/rfc1321.txt (2009\/11\/27) (1992)","DOI":"10.17487\/rfc1321"},{"issue":"3","key":"100_CR30","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1008220711840","volume":"12","author":"N. Rogier","year":"1997","unstructured":"Rogier N., Chauvaud P.: MD2 is not secure without the checksum byte. Des. Codes Cryptogr. 12(3), 245\u2013251 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"100_CR31","unstructured":"Rostekhregulirovaniye (Russia\u2019s Federal Agency for Technical Regulation and Metrology): GOST R 34.11-94: Information technology\u2014 cryptographic data security\u2014hashing function (1994)"},{"key":"100_CR32","doi-asserted-by":"crossref","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002, Proceedings, Lecture Notes in Computer Science, vol. 2442, pp. 288\u2013303. Springer (2002)","DOI":"10.1007\/3-540-45708-9_19"},{"key":"100_CR33","doi-asserted-by":"crossref","unstructured":"Wang, X., Yin, Y., Yu, H.: Efficient collision search attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005, Proceedings, Lecture Notes in Computer Science, vol. 3621, pp. 1\u201316. Springer (2005)","DOI":"10.1007\/11535218_1"},{"key":"100_CR34","doi-asserted-by":"crossref","unstructured":"Wang, X., Yin, Y., Yu, H.: Finding collisions in the full SHA-1. In: Shoup V. (ed.) CRYPTO 2005, Proceedings, Lecture Notes in Computer Science, vol. 3621, pp. 17\u201336. Springer (2005)","DOI":"10.1007\/11535218_2"},{"key":"100_CR35","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer, R. (ed.) EUROCRYPT 2005, Proceedings, Lecture Notes in Computer Science, vol. 3494, pp. 19\u201335. Springer (2005)","DOI":"10.1007\/11426639_2"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-009-0100-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-009-0100-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-009-0100-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T09:42:26Z","timestamp":1685353346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-009-0100-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,31]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["100"],"URL":"https:\/\/doi.org\/10.1007\/s10207-009-0100-7","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,31]]}}}