FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2009, VOLUME 15, NUMBER 5, PAGES 199-208

Public-key cryptographic system based on generalized satisfiability problem

E. A. Potseluevskaya

Abstract

View as HTML     View as gif image

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.

Location: http://mech.math.msu.su/~fpm/eng/k09/k095/k09510h.htm
Last modified: October 8, 2010