论文标题
p！= np的证明（针对任何线性攻击和差异攻击的新的对称加密算法）
A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
论文作者
论文摘要
P与NP问题是计算复杂性领域中最重要的未解决的问题。它的影响已经渗透到算法设计的各个方面，尤其是在密码学领域。基于短键的加密算法的安全性取决于P是否等于NP。实际上，Shannon [1]严格证明了一次性PAD系统符合无条件的安全性，但是由于一次性pad系统要求至少键的键长度是纯文本的长度，所以如何传输密钥是一个麻烦的问题，这是一个麻烦的问题，限制了在实践中一次性pad系统的使用。实践中使用的密码学算法都是基于简短键，而短密钥机制的安全性最终基于“单向”假设，也就是说，假定存在单向函数。实际上，单向函数的存在可以直接导致重要的结论p！= np。在本文中，我们最初构建了一种短键密码密码算法。该算法的核心特征是，对于任何块，当知道纯文本 - 文本对时，钥匙空间中的任何键都可以满足明文 - 亲密文本对，也就是说，对于每个块，对于每个块，明文 - ciphertext对，钥匙是独立性，而块之间的独立性也很容易构造。此功能与所有现有的短键密码算法完全不同。基于上述功能，我们构建了一个问题，从理论上证明该问题满足了单向函数的属性，从而解决了单向函数的存在问题，也就是说，即直接证明P！= NP。
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, Shannon[1] strictly proved that the one-time-pad system meets unconditional security, but because the one-time-pad system requires the length of key to be at least the length of plaintext, how to transfer the key is a troublesome problem that restricts the use of the one-time-pad system in practice. Cryptography algorithms used in practice are all based on short key, and the security of the short key mechanism is ultimately based on "one-way" assumption, that is, it is assumed that a one-way function exists. In fact, the existence of one-way function can directly lead to the important conclusion P != NP. In this paper, we originally constructed a short-key block cipher algorithm. The core feature of this algorithm is that for any block, when a plaintext-ciphertext pair is known, any key in the key space can satisfy the plaintext-ciphertext pair, that is, for each block, the plaintext-ciphertext pair and the key are independence, and the independence between blocks is also easy to construct. This feature is completely different from all existing short-key cipher algorithms. Based on the above feature, we construct a problem and theoretically prove that the problem satisfies the properties of one-way functions, thereby solving the problem of the existence of one-way functions, that is, directly proving that P != NP.
