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

Gao Ming

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…