The RSA Cryptographic Protocol Is Not Secure ()
Affiliation(s)
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.
KEYWORDS
Share and Cite:
Copyright © 2024 by authors and Scientific Research Publishing Inc.
This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.