Firstly, we introduce a common proposition "the existence of one-way functions =>P≠NP", which is considered a fundamental theorem in general cryptography or computational complexity theory. one-way functions have two conditions:
1) calculating f(x) can be completed in polynomial time.
2) Calculating the inverse function f^{-1}(x) cannot be completed in polynomial time.
If we find a one-way function, it means that...