Faster multicollisions attack on sponge construction

Multicollision attacks are sophisticated attacks that are analyzed in cryptographic hash functions. Previous works on multicollision have reported that the technique of determining the t-collisions where t > 2 is no more difficult than that of identifying the 2-collisions. Kelsey and Schneier...

Full description

Saved in:
Bibliographic Details
Main Authors: Hammad B.T., Jamil N., Zaba M.R., Rusli M.E., Ahmed I.T.
Other Authors: 57193327622
Format: Article
Published: American Scientific Publishers 2023
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Tenaga Nasional
id my.uniten.dspace-23429
record_format dspace
spelling my.uniten.dspace-234292023-05-29T14:40:25Z Faster multicollisions attack on sponge construction Hammad B.T. Jamil N. Zaba M.R. Rusli M.E. Ahmed I.T. 57193327622 36682671900 24726154700 16246214600 57193324906 Multicollision attacks are sophisticated attacks that are analyzed in cryptographic hash functions. Previous works on multicollision have reported that the technique of determining the t-collisions where t > 2 is no more difficult than that of identifying the 2-collisions. Kelsey and Schneier have improved the technique by using a fixed point to locate the multicollision with the complexity of 3.2n/2. Aumasson has developed a new attack known as the faster multicollision based on the Kelsey and Schneier attacks and implemented it in the Merkle-Damg�rd construction with a complexity of 2n/2. However, this technique has never been applied to the sponge construction. In this paper, a recent multicollision attack is applied on sponge construction and we found that the sponge construction has no resistance against such attacks when c = n. � 2017 American Scientific Publishers All rights reserved. Final 2023-05-29T06:40:25Z 2023-05-29T06:40:25Z 2017 Article 10.1166/asl.2017.7399 2-s2.0-85027831637 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027831637&doi=10.1166%2fasl.2017.7399&partnerID=40&md5=c9f206c0cbd2c9c942e6d322c592e386 https://irepository.uniten.edu.my/handle/123456789/23429 23 6 5457 5460 American Scientific Publishers Scopus
institution Universiti Tenaga Nasional
building UNITEN Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Tenaga Nasional
content_source UNITEN Institutional Repository
url_provider http://dspace.uniten.edu.my/
description Multicollision attacks are sophisticated attacks that are analyzed in cryptographic hash functions. Previous works on multicollision have reported that the technique of determining the t-collisions where t > 2 is no more difficult than that of identifying the 2-collisions. Kelsey and Schneier have improved the technique by using a fixed point to locate the multicollision with the complexity of 3.2n/2. Aumasson has developed a new attack known as the faster multicollision based on the Kelsey and Schneier attacks and implemented it in the Merkle-Damg�rd construction with a complexity of 2n/2. However, this technique has never been applied to the sponge construction. In this paper, a recent multicollision attack is applied on sponge construction and we found that the sponge construction has no resistance against such attacks when c = n. � 2017 American Scientific Publishers All rights reserved.
author2 57193327622
author_facet 57193327622
Hammad B.T.
Jamil N.
Zaba M.R.
Rusli M.E.
Ahmed I.T.
format Article
author Hammad B.T.
Jamil N.
Zaba M.R.
Rusli M.E.
Ahmed I.T.
spellingShingle Hammad B.T.
Jamil N.
Zaba M.R.
Rusli M.E.
Ahmed I.T.
Faster multicollisions attack on sponge construction
author_sort Hammad B.T.
title Faster multicollisions attack on sponge construction
title_short Faster multicollisions attack on sponge construction
title_full Faster multicollisions attack on sponge construction
title_fullStr Faster multicollisions attack on sponge construction
title_full_unstemmed Faster multicollisions attack on sponge construction
title_sort faster multicollisions attack on sponge construction
publisher American Scientific Publishers
publishDate 2023
_version_ 1806428359038599168