A Hash Algorithm Based on Scalable Precision Chaos

Abstract

The invention discloses a Hash algorithm based on extensible precision chaos in information security, which comprises the following steps of: 1) taking input information as an initial parameter and a control parameter based on an extensible precision logistic mapping, setting the chaotic mapping iterations and the precision of the obtained chaotic random sequence; 2) carrying out the chaotic iterative computation based on extensible precision, obtaining a chaotic random sequence and saving in a one-dimensional array; 3) setting the number of information bits required to be extracted and saving the information bit number pairs in the chaotic random sequence of the one-dimensional array for grouping; and 4) setting seeds, randomly siting and saving the seeds in the array. The Hash algorithm is established on the basis of extensible precision calculation chaos and fully utilizes the characteristic of chaos. The invention provides the novel and safe Hash algorithm satisfying the demands of different users. The Hash algorithm can be applied to the field of computer science using a Hash technology, including the technical fields of computer security, information security, cryptology, pattern matching, digital communication and the like.

Description

technical field [0001] The invention relates to a hash algorithm based on scalable precision chaos, which belongs to the field of computer science of hash technology. Background technique [0002] In the field of computer science, "Hash" is generally translated as "hash", and there are also direct transliterations into "hash", which is to transform an input of any length into a fixed-length output through a hash algorithm, and the output is the hash value. . For example, the widely used hash table. The hash table maps a group of keywords (key) to a limited address range according to the set hash function Hash(key), and uses the image of the keyword in the address range as the storage recorded in the table This table is called a hash table or a hash, and the resulting storage location is called a hash address or a hash address (Address). Can be expressed as: [0003] Address=Hash(key). [0004] Compared with tables and queues as a linear data structure, in theory, hash t...

AI Technical Summary

Problems solved by technology

[0015] 2. The chaotic system is extremely sensitive to the initial state, and a very small deviation of the initial condition will cause a great difference in the results; that is, the so-called "butterfly effect" - "a butterfly in the tropical rainforest of the Amazon River Basin in South America, Occasionally, a few flaps of its wings may cause a tornado in Texas, USA in two weeks”;

[0017] 4. Deterministic randomness, the dynamic behavior of the chaotic system is extremely complex, does not conform to the principles of probability and statistics, and is close to white noise; therefore, it is difficult to reconstruct and predict

Because the chaos calculated based on the finite precision of the computer is very different from the chaos on the continuous domain, that is, because the value of the corresponding chaotic sequence obtained after digital quantization is difficult to accurately represent the real value of the calculated chaos, the quantization error It refers to the calculation rounding error caused by the limited calculation precision of the computer, that is, due to the limited word length of the computer, in the process of numerical calculation, the intermediate result data obtained by the calculation should be approximated by using "rounding" or other calculation rules, so make the calculation process error

Images