[Resource Topic] 2015/771: A SAT-based Public Key Cryptography Scheme

Welcome to the resource topic for 2015/771

A SAT-based Public Key Cryptography Scheme

Authors: 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.

ePrint: https://eprint.iacr.org/2015/771

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .