On the Security of Multivariate Hash Functions

• 作 者: 罗宜元 来学嘉
• 机 构: Department of Computer Science and Engineering,Shanghai Jiaotong University,
• 出 处: Journal of Shanghai Jiaotong University(Science)
• 发表日期: 2009年02期
• 关键词: multivariate trivial explicitly conclude message have Probability chosen disting

Multivariate hash functions axe a type of hash functions whose compression function is explicitly defined as a sequence of multivariate equations.Billet et al designed the hash function MQ-HASH and Ding et al proposed a similar construction.In this paper,we analyze the security of multivariate hash functions and conclude that low degree multivariate functions such as MQ-HASH are neither pseudo-random nor unpredictable.There may be trivial collisions and fixed point attacks if the parameters of the compression function have been chosen. And they are also not computation-resistance,which makes MAC forgery easily.

Multivariate hash functions ax a type of hash functions whose compression function is explicitly defined as a sequence of multivariate equations. Billet et al designed the hash function MQ-HASH and Ding et al proposed a similar construction. In this paper, we analyze the security of multivariate hash functions and conclude that low degree multivariate functions such as MQ-HASH are neither pseudo-random nor unpredictable.There may be trivial collisions and fixed point attacks if the parameters of the compression function have been chosen. And they are also not computation- resistance, which makes MAC forgery easily.