C. H. Papadimitriou, “On Selecting a Satisfying Truth Assignment,” Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, San Juan, 1-4 October 1991, pp. 163-169.
has been cited by the following article:
TITLE: The RSA Cryptographic Protocol Is Not Secure
AUTHORS: Cristian Dumitrescu
KEYWORDS: The Satisfiability Problem; Hamming Distance; Random Walk with Two Absorbing Barriers
JOURNAL NAME: Applied Mathematics, Vol.4 No.12, December 3, 2013
ABSTRACT: In this article I describe a randomized algorithm based on random walks with two absorbing barriers that solves the satisfiability problem (known to be NP complete) with arbitrary high probability. As a consequence of this algorithm, I also prove that the RSA cryptographic protocol is not secure.