Direct and inverse factorization algorithms of numbers
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 t...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius University Press
2019-12-01
|
| Series: | Lietuvos Matematikos Rinkinys |
| Subjects: | |
| Online Access: | https://www.journals.vu.lt/LMR/article/view/15234 |
| Summary: | 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. |
|---|---|
| ISSN: | 0132-2818 2335-898X |