2 citations · 4 across the 12 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.CC2011
About set-theoretic properties of one-way functions
Anatoly D. Plotnikov
We investigate the problem of cryptanalysis as a problem belonging to the class NP. A class of problems UF is defined for which the time constructing any feasible solution is polyn…
cs.DM2011
On the relationship between classes P and NP
Anatoly D. Plotnikov
In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An alg…
cs.CR2011
Encipher of information on the basis of geometrical presentations
A. S. Petrov, A. D. Plotnikov
In this paper, we examine a ciphertext on the basis of using geometrical objects. Each symbol normative alphabet is determined as a point on the plane. We consider possible ways fo…