Hash function method with single round collision-proof performance

Abstract

The invention discloses a hash function method with single round of anti-collision performance, belonging to the information security technology field. The method comprises the following steps: taking a coupling mapping lattice as a model, a method which combines floating-point operation and the traditional bit operation is adopted. The coupling mapping adopts a way which combines the local area and overall coupling; the state variables in the mapping is determined by the chain variables; and the parameters in the mapping are determined by the input information and the expansion information thereof. Expansion is carried out to the input information by a non-linear ff (comprising cyclic shift, a module addition method and S-box operation) operation. Two overall coupling variables are introduced, and the overall coupling variables are a function of all the input information and the state variables. A module is taken towards the output variables and carries out exclusive calculation with an input chain variable and information; then the obtained result is changed into a real number as the continued iteration of the input value of the mapping. The invention uses the single round of high complexity and less rounds of calculation cost for guaranteeing the security thereof. The method has precise structure and changeable length of output hash value, is easy for software realization, and can also be realized by embedded type CPU technology hardware.

Description

technical field [0001] The invention relates to the technical field of information security, more specifically, a hash function method is designed. Background technique [0002] A hash function, also called a one-way hash function, is a function that compresses a message of any length into a message digest (also called a hash value) with a fixed length. There are many functions that meet this condition, but the hash function also requires to meet the following characteristics: (1) For a given message, it is easy to calculate its hash value; (2) Given a hash value, calculate the original Messages are computationally impossible; (3) Given a message and a hash value, it is impossible to find another different message such that they have the same hash value; (4) For any given different message , it is impossible to make their hash values ​​the same. Impossible here means that it is computationally impossible under the existing resource conditions. [0003] The application of ...

AI Technical Summary

Problems solved by technology

The first reason is that the former is beneficial to hardware implementation, and the second is that it is easy to use analytical inverse operations to achieve collisions for analytical operations.

Images