Polynomial time factoring algorithm using Bayesian arithmetic
Data Structures and Algorithms
2012-12-21 v1
Abstract
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion that P = NP. Now, we implement this concept in elementary arithmetic and especially in multiplication. This provides a polynomial time deterministic factoring algorithm, while no such algorithm is known to day. This result clearly appeals for a revaluation of the current cryptosystems. The Bayesian arithmetic environment can also be regarded as a toy model for quantum mechanics.
Cite
@article{arxiv.1212.4969,
title = {Polynomial time factoring algorithm using Bayesian arithmetic},
author = {Michel Feldmann},
journal= {arXiv preprint arXiv:1212.4969},
year = {2012}
}
Comments
13 pages, no figure