A cryptosystem based on propositional logic
A new public key cryptosystem based on propositional calculus is presented. The system is proved optimal in the sense that any cryptanalytic method against it can be used to break other cryptosystems as well. Such a cryptanalytic method could also be used to solve in polynomial time the membership problem of any language in NPnCoNP. Only worst case complexities are considered.
Unable to display preview. Download preview PDF.
- W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory IT-22 (1976), 644–654.Google Scholar
- S. Goldwasser and S. Micali, Probabilistic encryption & how to play mental poker keeping secret all partial information, in: Proceedings of the 14th ACM Symposium on the Theory of Computing (1982), 365–377.Google Scholar
- A. Salomaa, Computation and Automata (Cambridge University Press, 1985).Google Scholar