Please use this identifier to cite or link to this item:
http://dspace.uniten.edu.my/jspui/handle/123456789/7606
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hammad, B.T. | en_US |
dc.contributor.author | Jamil, N. | en_US |
dc.contributor.author | Zaba, M.R. | en_US |
dc.contributor.author | Rusli, M.E. | en_US |
dc.contributor.author | Ahmed, I.T. | en_US |
dc.date.accessioned | 2018-01-11T09:56:53Z | - |
dc.date.available | 2018-01-11T09:56:53Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | http://dspace.uniten.edu.my/jspui/handle/123456789/7606 | - |
dc.description.abstract | 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. | - |
dc.language.iso | en | en_US |
dc.title | Faster multicollisions attack on sponge construction | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1166/asl.2017.7399 | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | CCI Scholarly Publication |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.