Specifications

Methods
DOI: 10.1016/j.amc.2013.07.073
Database: Compendex
Compilation and indexing terms, © 2013 Elsevier Inc.
8.
Accession number: 20133716721827
Title: New multivariate hash function quadratic polynomials multiplying linear polynomials
Authors: Zou, Youjiao1, 2 ; Ma, Wenping1 ; Ran, Zhanjun2 ; Wang, Shangping2/邹又姣;;;王尚平
Author affiliation: 1 State Key Laboratory of Integrated Service Networks, Xidian University,
710071 Xi'an, China
2 Department of Mathematics, Xi'an University of Technology, College of Science, 710048 Xi'an,
China
Source title: IET Information Security
Abbreviated source title: IET Inf. Secur.
Volume: 7
Issue: 3
Issue date: 2013
Publication year: 2013
Pages: 181-188
Language: English
ISSN: 17518709
E-ISSN: 17518717
Document type: Journal article (JA)
Publisher: Institution of Engineering and Technology, Six Hills Way, Stevenage, SG1 2AY, United
Kingdom
Abstract: In this study the authors propose a new multivariate hash function with HAsh
Iterative FrAmework framework which we call the hash function quadratic polynomials
multiplying linear polynomials (QML). The new hash function is made of cubic polynomials which
are the products of quadratic polynomials and linear polynomials. The authors design the
quadraticpolynomial part of the compression function based on the centre map of the
multivariate public key cryptosystem Matsumoto-Imai cryptosystem (MI). The hash function QML
can keep the three cryptography properties and be immune to the pre-image attack, second
pre-image attack, collision attack, differential attack and algebraic attack. The required memory
storage is about 50% of the one which is built of the cubic polynomials and their coefficients are
random. On the avalanche effect, by experiments the authors get the result that about one half
of the output bits are different when one input bit is changed randomly. The one-round diffusion
of the hash function QML is twice of that of Blake. Also the authors simplify the matrixes of the
new hash function, analyse the rationality and show the comparable data. Finally, the authors
give the advice to the parameters of the new hash function and summarise the paper. © The
Institution of Engineering and Technology 2013.
Number of references: 28
Main heading: Polynomials
Controlled terms: Digital storage - Hash functions - Public key cryptography