Reference tothe works [22] and [23] releases me from the need for describing the history of formation and development in TCS (I assume this abbreviation as more preferable than informatics) of the relationship between the classes of problems P and NP. In these works with a sufficient completeness the past and present of this problematics is described. But the future remained uncertain, since to the author of the specified works does not know: NP=P or NP =/= P.
Now, when it became known that NP=P, should be warned all, who deal concerning contemporary cryptography with the open key, that all its conclusions (for example, see [24]) about time needs of the burglar, they are based on the assumption: NP=/=P. But this assumption is not true. Such problems, as the skill to factorize the large numbers, to take the discrete logarithm in the final field and many others, which are included into the list of NP-complete problems, can be solved by algorithms with the polynomial time complexity, therefore, the rates which were done earlier and we could be considered enough proved now become very unsteady, if we do not to say even ridiculous, but with quite possible sad consequences.
Since recognition SAT is a special case of the superreduction of SAT-problem, the further in item5.