A SAT-based Public Key Cryptography Scheme

Sebastian E.  Schmittner

Paper 2015/771

A SAT-based Public Key Cryptography Scheme

Sebastian E. Schmittner

Abstract

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

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: Public key cryptosystems Cryptographic protocols Data Encryption Message authentication Digital signatures
Contact author(s): ses @ thp uni-koeln de
History: 2015-08-17: last of 3 revisions; 2015-08-03: received; See all versions
Short URL: https://ia.cr/2015/771
License: CC BY

BibTeX

@misc{cryptoeprint:2015/771,
      author = {Sebastian E.  Schmittner},
      title = {A {SAT}-based Public Key Cryptography Scheme},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/771},
      year = {2015},
      url = {https://eprint.iacr.org/2015/771}
}