The RSA Cryptographic Protocol Is Not Secure

• 作者: Cristian Dumitrescu
• 来源期刊: 应用数学(英文)
• 学科: 医学
• 关键词: The SATISFIABILITY PROBLEM Hamming DISTANCE RANDOM WALK with Two Absorbing Barriers
• 年，卷（期）: yysxyw_2013,（12）
• 页码范围: 1635-1636
• 页数: 2页
• 分类号: R73

摘要

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.