Research ArticleOpen AccessGoogle Scholar indexed
The RSA Cryptographic Protocol Is Not Secure
Kitchener, Canada
- 1 Kitchener, Canada
Applied Mathematics·Volume 04 (2013)·Pages 1635–1636·Published 8 November 2013·DOI10.4236/am.2013.412222
Copy link · social · email
Abstract
In this article I describe a randomized algorithm based on random walks with two absorbing barriers that solves the sat isfiability 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.
KeywordsThe Satisfiability ProblemHamming DistanceRandom Walk with Two Absorbing Barriers
- J. E. Hopcroft and J. D. Ullman, “Introduction to Automata Theory, Langiages, and Computation,” AddisonWesley Publishing Company, Cambridge, 1979.
- W. Feller, “An Introduction to Probability Theory and Its Applications,” John Wiley & Sons, New York, 1968.
- L. Fortnow, “The Golden Ticket, P, NP, and the Search for the Impossible,” Princeton University Press, Princeton, 2013.
- 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.