arXiv:2203.05022 [pdf] cs.CC cs.IT A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks) Authors: Gao Ming 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.
