Hash algorithm based on complex dynamic network

A complex dynamic network and network technology, applied in the field of Hash algorithm, can solve the problems of many iterations and high algorithm complexity, and achieve the effect of low computational complexity, reduced algorithm complexity, and reduced computational complexity

Active Publication Date: 2010-10-27
盐城市鹤业实业投资有限公司
View PDF2 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0015] In order to overcome the algorithm iteration times of chaotic map existing in the prior art too much, the problem technical problem that algorithm complexity is higher, the purpose of the present invention is to provide a kind of Hash Function Construction Algorithm Based on Complex Dynamic Network

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Hash algorithm based on complex dynamic network
  • Hash algorithm based on complex dynamic network
  • Hash algorithm based on complex dynamic network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] A Hash function construction algorithm based on a complex dynamic network according to the present invention, the method adopts a complex dynamic network based on a message, maps the network parameters to a chaotic coupling mapping network for iterative and quantitative processing, and obtains a Hash value, specifically including The following steps:

[0034] 1. Preprocess the original message

[0035] The original message M is first transformed as follows:

[0036] M'=M+string(|M|)+padding (1)

[0037] Its purpose is to make the transformed message M' can be divided into K message sub-blocks M with a length of Lbits k (k=1,...,K), k message block number, (1) where '+' represents the concatenation operation of strings, string(|M|) is the string form of the length of the original message M; padding It refers to the filling bits when the last block is less than Lbits to ensure that the last sub-block is also L bits;

[0038] 2. Initialize related parameters

[0039] ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a Hash algorithm based on a complex dynamic network. The algorithm comprises constructing a message block network MBN with message blocks of original messages treating Hash according to certain rules, mapping point sets and edge sets of the MBN into initial values of node states and adjacency matrixes of a complex dynamic network CDN according to certain transformation rules, thereby forming the weighted complex dynamic network WCDN with an original message structure. The Hash value can be obtained finally through iteration, quantization and difference processing of the WCDN of each message block. The invention adopts the extreme sensitivity of the WCDN to the initial values and parameters, and can obtain safety performance with excellent confusion and diffusion after multiple WCDN iterations. Simultaneously, the invention can effectively reduce the computational complexity.

Description

technical field [0001] The invention belongs to the technical field of computer and information security, in particular to a complex dynamic network-based Hash algorithm for information networks. Background technique [0002] The Hash function is mainly used for encryption algorithms in the field of information security. Simply put, it is a function that compresses a message of any length into a message digest of a certain length. [0003] The Hash function H maps a message M of arbitrary length into a fixed-length Hash value h, that is, h=H(M), and its purpose is to generate "fingerprints" of files, messages or other data blocks. Hash functions can be directly applied to data integrity checks, authentication protocols, zero-knowledge proofs, random number generators, etc., and have very important applications in digital signatures and message verification codes. Hash functions must have the following properties: [0004] 1. The Hash function can be applied to data blocks ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/15H04L29/06
Inventor 蒋国平宋玉蓉樊春霞王亚奇
Owner 盐城市鹤业实业投资有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap