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...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | |
Published: |
2018
|
Online Access: | http://dspace.uniten.edu.my/jspui/handle/123456789/7606 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.uniten.dspace-7606 |
---|---|
record_format |
dspace |
spelling |
my.uniten.dspace-76062018-01-11T09:56:53Z Faster multicollisions attack on sponge construction Hammad, B.T. Jamil, N. Zaba, M.R. Rusli, M.E. Ahmed, I.T. 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. 2018-01-11T09:56:53Z 2018-01-11T09:56:53Z 2017 http://dspace.uniten.edu.my/jspui/handle/123456789/7606 |
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. |
format |
|
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_facet |
Hammad, B.T. Jamil, N. Zaba, M.R. Rusli, M.E. Ahmed, I.T. |
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 |
publishDate |
2018 |
url |
http://dspace.uniten.edu.my/jspui/handle/123456789/7606 |
_version_ |
1644494243400515584 |
score |
13.160551 |