2 citations · 4 across the 12 of their papers we have counts for
1 paper · 2 filters
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…