2012/12/20 by Michel Feldmann, M. Feldmann, Feldmann, Michel · 1 voice
Computer Science · #Chaos-based Image/Signal Encryption #Computability, Logic, AI Algorithms #Quantum Computing Algorithms and Architecture #cs.DS
paper · pdf · doi:10.48550/arxiv.1212.4969
13 pages, no figure
arxiv created 2012/12/20 · arxiv updated 2012/12/21
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.