The RSA Cryptographic Protocol Is Not Secure

The RSA Cryptographic Protocol Is Not Secure

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied mathematics (Irvine, Calif.) Calif.), 2013-12, Vol.4 (12), p.1635-1636
1. Verfasser: Dumitrescu, Cristian
Format: Artikel
Sprache:eng
Schlagworte:
Absorption
Algorithms
Barriers
Cryptography
Mathematical analysis
Random walk
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2152-7385
2152-7393
DOI:10.4236/am.2013.412222