An Original Numerical Factorization Algorithm

George Kostopoulos

《Journal of Information Assurance & Cybersecurity》 2016卷 (2016/12) Pp. a1-8

https://doi.org/10.5171/2016.775081

摘要

This paper presents a mathematical algorithm that supports the identification of prime numbers the product of which results in a given number. The associated research has found several dissimilar factorization algorithms. Considering that, none of the found algorithms resembles the one presented here; it is the author's belief that the presented algorithm is original. Using the algorithm presented in this paper, factorization is not a trial and error process, but a finite step by step process that can be very easily programmed and executed. Consequently, the ability to easily factorize a given number will disrupt existing numerical methodologies, while opening up possibilities for new cryptosyntesis and cryptanalysis areas of research and applications.

關鍵字

Factorization ； Numerical Analysis ； Prime Numbers ； cryptography