@article{kostopoulos2016original,
  title = {An Original Numerical Factorization Algorithm},
  author = {George Kostopoulos},
  year = 2016,
  url = {https://ibimapublishing.com/articles/JIACS/2016/775081/},
  journal = {Journal of Information Assurance & Cybersecurity},
  volume = (2016),
  pages = 8,
  doi = 10.5171/2016.775081,
  abstract = {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.},
  keywords = {Factorization; Numerical Analysis; Prime Numbers, cryptography},
  note = Article ID: 775081
}