Sebastian E. Schmittner

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1