|
|
Fundamentalnaya i Prikladnaya Matematika, 2009, Volume 15, Issue 5, Pages 199–208
(Mi fpm1252)
|
|
|
|
Public-key cryptographic system based on generalized satisfiability problem
E. A. Potseluevskaya M. V. Lomonosov Moscow State University
Abstract:
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.
Citation:
E. A. Potseluevskaya, “Public-key cryptographic system based on generalized satisfiability problem”, Fundam. Prikl. Mat., 15:5 (2009), 199–208; J. Math. Sci., 172:5 (2011), 751–758
Linking options:
https://www.mathnet.ru/eng/fpm1252 https://www.mathnet.ru/eng/fpm/v15/i5/p199
|
|