Public key cipher encrypting and decrypting method based on nerval network chaotic attractor

Abstract

The invention relates to a public key code encrypt method, based on neural net chaotic attractor, which comprises: inputting key, coding attractor, coding clear text and generating ciphertext. Since the safety of said invention is based on the decomposition hardness of high-order singular matrix, but not based on the decomposition hardness of single large number factor as RSA method, it has high safety, high encrypt speed, and the applications in modern group encrypted communication and business encrypted communication.

Description

technical field [0001] The invention relates to the technical field of information encryption, in particular to a public key encryption and decryption method based on a neural network chaotic attractor. Background technique [0002] The Internet (Internet) has developed vigorously in the past 30 years and has become the main way for people to exchange information. Many sensitive information, including business secrets, military secrets and personal confidential information, need to be transmitted quickly and conveniently through the Internet, which puts forward higher requirements for the security of network communication. [0003] The security of modern network communication is mainly based on cryptography. Among them, compared with the symmetric cryptosystem, the public key cryptosystem has the main advantages of convenient password management and fewer keys. Since Diffie W and Hellman M proposed the idea of ​​public key cryptosystem in 1976, many public key cryptographi...

AI Technical Summary

Problems solved by technology

However, the RSA public-key cryptographic algorithm has two insurmountable shortcomings. One is that the security of the algorithm depends on the difficulty of factorization. With the development of computer technology and number theory, the decomposable factors are getting larger and larger. Therefore, the Algorithms can only improve computing security by increasing the length of the key. The increase in the length of the key will bring many new problems, such as increasing the difficulty of key management, sharply reducing the key space, and further reducing the speed of encryption and decryption, etc. ; The second main disadvantage is that the speed of encryption and decryption is relatively slow. Because there are many large exponent operations and modulo operations in the algorithm, the calculation amount is relatively large, so the speed of data encryption and decryption is relatively slow. At present, the fastest is only 45.8 kbps, such an encryption speed is difficult to meet the real-time requirements in the secure communication of the next generation Internet

Compared with RSA, the elliptic curve public key cryptography algorithm that has been studied more recently, although it can use a shorter key to achieve the security effect of a longer RSA key, but it still has a large amount of calculation, data encryption speed and decryption. The speed is relatively slow, and the problem of how to effectively encode the information data that needs to be encrypted into points on the elliptic curve has not been solved

Images