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.