Geodesic
Public-key cryptographic system based on generalized satisfiability problem
Fundamentalʹnaâ i prikladnaâ matematika, Tome 15 (2009) no. 5, pp. 199-208
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In the modern world, a considerable part of information is processed in electronic form. The necessity of protection of this information during its transmission over open communication channels has lead to a wide spread of public-key cryptographic systems based on different NP-complete problems. In this article, the realization of an asymmetric cryptosystem based on an NP-complete S-satisfiability problem is concerned. 
@article{FPM_2009_15_5_a9,
     author = {E. A. Potseluevskaya},
     title = {Public-key cryptographic system based on generalized satisfiability problem},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {199--208},
     year = {2009},
     volume = {15},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_2009_15_5_a9/}
}
TY  - JOUR
AU  - E. A. Potseluevskaya
TI  - Public-key cryptographic system based on generalized satisfiability problem
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 2009
SP  - 199
EP  - 208
VL  - 15
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/FPM_2009_15_5_a9/
LA  - ru
ID  - FPM_2009_15_5_a9
ER  - 
%0 Journal Article
%A E. A. Potseluevskaya
%T Public-key cryptographic system based on generalized satisfiability problem
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2009
%P 199-208
%V 15
%N 5
%U http://geodesic.mathdoc.fr/item/FPM_2009_15_5_a9/
%G ru
%F FPM_2009_15_5_a9
E. A. Potseluevskaya. Public-key cryptographic system based on generalized satisfiability problem. Fundamentalʹnaâ i prikladnaâ matematika, Tome 15 (2009) no. 5, pp. 199-208. http://geodesic.mathdoc.fr/item/FPM_2009_15_5_a9/

[1] Alekseev V. B., Nosov V. A., “NP-polnye zadachi i ikh polinomialnye varianty. Obzor”, Obozrenie prikladnoi i promyshlennoi matematiki, 4:2 (1997), 165–193

[2] Potseluevskaya E. A., “Polinomialnye sluchai resheniya zadachi ob F-vypolnimosti bulevykh formul”, Intellekt. sist., 12:1–4 (2008), 351–362 | MR

[3] Schaefer T. J., “The complexity of satisfiability problems”, Proc. of the 10th ACM Symp. on Theory of Computing, ACM Press, 1978, 216–226 | MR | Zbl