Public-key cryptographic system based on generalized satisfiability problem

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 led to widespread 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 studied.