A SAT-based Public Key Cryptography Scheme

This addresses the need for secure public key cryptography, but it appears incremental as it builds on existing SAT-based and homomorphic concepts without claiming major breakthroughs.

The authors tackled the problem of designing a public key cryptography scheme by proposing a homomorphic scheme based on the Boolean Satisfiability Problem, where the public key is a SAT formula satisfied by the private key, and encryption uses probabilistic functions implied false by the public key XORed with message bits, with a zero-knowledge proof for signatures.