A SAT-based Public Key Cryptography Scheme
Cryptography and Security
2015-08-19 v3
Abstract
A homomorphic public key crypto-scheme based on the Boolean Satisfiability Problem is proposed. The public key is a SAT formula satisfied by the private key. Probabilistic encryption generates functions implied to be false by the public key XOR the message bits. A zero-knowledge proof is used to provide signatures.
Keywords
Cite
@article{arxiv.1507.08094,
title = {A SAT-based Public Key Cryptography Scheme},
author = {Sebastian E. Schmittner},
journal= {arXiv preprint arXiv:1507.08094},
year = {2015}
}
Comments
7 pages + appendix, 1 figure + 6 in appendix