Trojan message attack on the concatenated hash functions

Shi-Wei CHEN; INChen-Hui J

doi:10.11959/j.issn.1000-436x.2016154

您当前的位置：

首页 >

文章列表页 >

Trojan message attack on the concatenated hash functions

Papers | 更新时间：2024-10-11

- Trojan message attack on the concatenated hash functions
- Journal on Communications Vol. 37, Issue 8, Pages: 45-50(2016)
- 作者机构：
  
  1. 解放军信息工程大学三院，河南郑州 450002
  2. 信息保障技术重点实验室，北京 100072
  1.1.解放军信息工程大学三院，河南郑州 450002;2.信息保障技术重点实验室，北京 100072
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.1000-436x.2016154
  CLC： TP918
- Online First：2016-08，
  
  Published：25 August 2016
- 稿件说明：
移动端阅览
Shi-Wei CHEN, INChen-Hui J. Trojan message attack on the concatenated hash functions[J]. Journal on Communications, 2016, 37(8): 45-50.
DOI：

Shi-Wei CHEN, INChen-Hui J. Trojan message attack on the concatenated hash functions[J]. Journal on Communications, 2016, 37(8): 45-50. DOI： 10.11959/j.issn.1000-436x.2016154.

摘要

“特洛伊”消息攻击是Andreeva等针对MD结构杂凑函数提出的一种攻击方法，首次将其应用于不同于MD结构的一类杂凑函数，即联接杂凑。结合联接杂凑的特点，综合利用Joux的多碰撞和深度为n−l的“钻石树”结构多碰撞，构造出了2n-bit联接杂凑函数的长度为n 2

· 块的“特洛伊”消息，并据此首次提出了对其的固定前缀“特洛伊”消息攻击，其存储复杂性为2l+2

n−l+1

+n·2

k+1

块消息，时间复杂性为O(n·2

n+k

+l·2

)次压缩函数运算，远低于理想的时间复杂

性O(n·2

2n+k

)。

Abstract

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

· 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

n−l+1

+n·2

k+1

blocks and the time complexity is about O (n·2

n+k

+l·2

)computations of the compression function

much less than the ideal value O(n·2

2n+k

关键词

Keywords

references

MERKLE R . A certified digital signature [C ] // Advances in Cryptology-CRYPTO 1989.LNCS 435,Heidelberg:Springer-Verlag . c 1990 : 218 - 238 .

DAMGARD I . A design principle for hash functions [C ] // Advances in Cryptology-CRYPTO 1989.LNCS 435,Heidelberg:Springerr-Verlag . c 1990 : 416 - 427 .

JOUX A . Multicollisions in iterated hash functions application to cascaded constructions [C ] // Advances in Cryptology–CRYPTO 2004.LNCS 3152,Heidelberg:Springer-Verlag . c 2004 : 306 - 316 .

KELSEY J , SCHNEIER B . Second preimages on n-bit hash functions for much less than 2 n work [C ] // Advances in Cryptology- EUROCRYPT 2005.LNCS 3494,Heidelberg:Springer-Verlag . c 2005 : 474 - 490 .

KELSEY J , KOHNO T . Herding hash functions and the nostradamus attack [C ] // Advances in Cryptology–EUROCRYPT 2006.LNCS 4004,Heidelberg:Springer-Verlag . c 2006 : 183 - 200 .

陈士伟，金晨辉 . 对强化MD结构杂凑函数的一个新的“牧群”攻击 [J ] . 电子与信息学报， 2010 ， 32 ( 8 ): 1953 - 1955 .

CHEN S W , JIN C H . A new herding atlack on hash functions with strengthening Merke-Damgard(MD) construction [J ] . Journal of Elec-tronics ＆ Information Technology , 2010 , 32 ( 8 ): 1953 - 1955 .

ANDREEVA E , BOUILLAGUET C , DUNKELMAN O , et al . Herd-ing,second preimage and Trojan message attacks beyond Merkle-Damgård [C ] // Selected Areas in Cryptography 2009.LNCS 5867,Heidelberg:Springer-Verlag . c 2009 : 393 - 414 .

KORTELAINEN T , KORTELAINEN J . Advances in Cryptology–ASIACRYPT 2013,Part II,LNCS 8270.Heidelberg:Springer-Verlag [C ] // Advances in Cryptology–ASIACRYPT 2013,Part II,LNCS 8270.Heidelberg:Springer-Verlag . c 2013 : 524 - 539 .

Views

1452

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Measuring the complexity of military communication network based on supernetwork theory

Related Author

SHI Fu-li

ZHU Yi-fan

Related Institution

School of Information Systems ＆ Management,National University of Defense Technology

AI问答

⁰