A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)

Abstract

P vs NP problem is the most important unresolved problem in the field of computational complexity. Its impact has penetrated into all aspects of algorithm design, especially in the field of cryptography. The security of cryptographic algorithms based on short keys depends on whether P is equal to NP. In fact, the security requirements for cryptographic keys are much stricter than those for P $\ne$ NP, the security of the key must ensure not only a sufficiently high computational complexity to crack it, but also consider the security of each bit of the key, while fully avoiding the effectiveness of various attack methods. In this paper, we innovatively propose a new encoding mechanism and develop a novel block symmetric encryption algorithm, which be named Eagle, whose encryption and decryption can be completed in linear time. The key consists of 6 variables, for the attacker, in the case when only the plaintext-ciphertext correspondence is known, the problem of cracking the key is equivalent to solving a system of equations about six unknown variables. We prove that the computational complexity of verifying two variables should not be lower than the computational complexity of enumerating any intermediate unknown variable whose number of possible values is exponentially to the length of the key, thus proving that the computational complexity of verifying two variables can't be polynomial. Due to the computational complexity satisfying the condition of ``complexity of cracking the key = complexity of solving six variables $\ge$ complexity of solving two variables $\ge$ complexity of verifying two variables", thus the computational complexity of cracking the key can't be polynomial, So the decryption is a one-way function, and according to ``the existence of one-way function means P $\ne$ NP", thus solving the unsolved problem of P vs NP.