Nobody ever managed to prove before whether P equals or does not equal NP. As your paper mentioned that the existence of one-way functions opens up a proof to P!=NP, let's discuss that.
In that section you describe an encryption algorithm that uses language like:
the groups with less than L bits are randomly filled into L bits
generate the random growth group MT 1 to M
...where N1,N2 is randomly generated.
Do you see the problem here? Your algorithms rely on certain parameters being generated randomly, but there is no practical implementation that can generate truly random numbers. All of them have varying levels of pseudorandomness either by using an equation or deriving bits of entropy from the keyboard, thermal heat conducted from the processor, etc etc and even if it is not practical to guess that data, it is still theoretically possible.
This algorithm
in theory might be a one-way function (I didn't study the entire paper, sorry about that), but there is no practical way to implement the randomness to make it such.