Paper 2015/771

A SAT-based Public Key Cryptography Scheme

Sebastian E. Schmittner


A homomorphic public key cryptography scheme based on the Boolean Satisfiability Problem (SAT) is proposed. The public key is a SAT formula satisfied by the private key. The probabilistic encryption algorithm generates random Boolean functions, which are implied to be false by the public key. Adding the message bits to them yields the cipher functions. A variant of Blum's Hamilton cycle zero-knowledge proof, adapted to SAT, is used to provide an identification and, via a Fiat-Shamir heuristic, a signature scheme. These are conceptually independent from the encryption scheme.

Note: Added short section on homomorphic encryption

Available format(s)
Publication info
Preprint. MINOR revision.
Public key cryptosystemsCryptographic protocolsData EncryptionMessage authenticationDigital signatures
Contact author(s)
ses @ thp uni-koeln de
2015-08-17: last of 3 revisions
2015-08-03: received
See all versions
Short URL
Creative Commons Attribution


      author = {Sebastian E.  Schmittner},
      title = {A SAT-based Public Key Cryptography Scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2015/771},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.