arXiv Open Access 2011

About set-theoretic properties of one-way functions

Anatoly D. Plotnikov

Lihat Sumber

Abstrak

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 polynomial. The properties of the problems of NP, which may be one-way functions, are established.

Topik & Kata Kunci

cs.CC

Penulis (1)

Anatoly D. Plotnikov

Format Sitasi

APA MLA BibTeX

Plotnikov, A.D. (2011). About set-theoretic properties of one-way functions. https://arxiv.org/abs/1110.3189

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2011
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓