Trojan message attack on the concatenated hash functions
The Trojan message attack was proposed by Andreeva,et al.aiming at the hash functions with MD structure.First it was applied on the hash function beyond MD structure,that was,concatenated hash.Utilizing the property of the concatenated hash,and combining the Joux's multicollision and the “diamo...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2016-08-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016154/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841539172945362944 |
---|---|
author | Shi-Wei CHEN INChen-Hui J |
author_facet | Shi-Wei CHEN INChen-Hui J |
author_sort | Shi-Wei CHEN |
collection | DOAJ |
description | The Trojan message attack was proposed by Andreeva,et al.aiming at the hash functions with MD structure.First it was applied on the hash function beyond MD structure,that was,concatenated hash.Utilizing the property of the concatenated hash,and combining the Joux's multicollision and the “diamond” structure with the depth of n−l,a Trojan message of the length n 2<sup>k</sup>· blocks for the 2n-bit concatenated hash was constructed,based on which a chosen-prefix Trojan message attack was first proposed.And the memory complexity of proposed attack is about 2l+2<sup>n−l+1</sup>+n·2<sup>k+1</sup>blocks and the time complexity is about O (n·2<sup>n+k</sup>+l·2<sup>l</sup>)computations of the compression function,much less than the ideal value O(n·2<sup>2n+k</sup>). |
format | Article |
id | doaj-art-166f3c170a86478db8ac5e8392f8a1c7 |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2016-08-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-166f3c170a86478db8ac5e8392f8a1c72025-01-14T07:25:28ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2016-08-0137455059702585Trojan message attack on the concatenated hash functionsShi-Wei CHENINChen-Hui JThe Trojan message attack was proposed by Andreeva,et al.aiming at the hash functions with MD structure.First it was applied on the hash function beyond MD structure,that was,concatenated hash.Utilizing the property of the concatenated hash,and combining the Joux's multicollision and the “diamond” structure with the depth of n−l,a Trojan message of the length n 2<sup>k</sup>· blocks for the 2n-bit concatenated hash was constructed,based on which a chosen-prefix Trojan message attack was first proposed.And the memory complexity of proposed attack is about 2l+2<sup>n−l+1</sup>+n·2<sup>k+1</sup>blocks and the time complexity is about O (n·2<sup>n+k</sup>+l·2<sup>l</sup>)computations of the compression function,much less than the ideal value O(n·2<sup>2n+k</sup>).http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016154/hash functionsconcatenated hashTrojan message attackmulticollsioncomplexity |
spellingShingle | Shi-Wei CHEN INChen-Hui J Trojan message attack on the concatenated hash functions Tongxin xuebao hash functions concatenated hash Trojan message attack multicollsion complexity |
title | Trojan message attack on the concatenated hash functions |
title_full | Trojan message attack on the concatenated hash functions |
title_fullStr | Trojan message attack on the concatenated hash functions |
title_full_unstemmed | Trojan message attack on the concatenated hash functions |
title_short | Trojan message attack on the concatenated hash functions |
title_sort | trojan message attack on the concatenated hash functions |
topic | hash functions concatenated hash Trojan message attack multicollsion complexity |
url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016154/ |
work_keys_str_mv | AT shiweichen trojanmessageattackontheconcatenatedhashfunctions AT inchenhuij trojanmessageattackontheconcatenatedhashfunctions |