Direct and inverse factorization algorithms of numbers
Articles
Grigorijus Melničenko
Vytautas Magnus University
Published 2019-12-05
https://doi.org/10.15388/LMR.B.2019.15234
PDF

Keywords

prime numbers
trial division
Fermats factorization algorithm

How to Cite

Melničenko G. (2019) “Direct and inverse factorization algorithms of numbers”, Lietuvos matematikos rinkinys, 60(B), pp. 39-45. doi: 10.15388/LMR.B.2019.15234.

Abstract

The factoring natural numbers into factors is a complex computational task. The complexity of solving this problem lies at the heart of RSA security, one of the most famous cryptographic methods. The classical trial division algorithm divides a given number N into all divisors, starting from 2 and to integer part of N. Therefore, this algorithm can be called the direct trial division algorithm. We present the inverse trial division algorithm, which divides a given number N into all divisors,
starting from the integer part of √N to 2.

 

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy

Most read articles by the same author(s)