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.

UDC: 004.056.55

 English version: Journal of Mathematical Sciences (New York), 2011, 172:5, 751–758

Bibliographic databases:

• 
•