Work

A New Parallel Integer Factorization Algorithm based on Simple Continued Fraction Expansion of √𝑁

Year: 2025

Type: article

Abstract: I propose a new factorization algorithm based on residues from the expansion in continued fractions of the square root of the number to be factored. The algorithm searches for repeated residues and, from these, and from the respective convergents, associated with these residues, determines the factors of the number.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.15197713

Author: Marçal, Adriano

Institution: National Observatory

Language: English

Topic: Cryptography and Residue Arithmetic

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W6911925708

FWCI:

Cites:

Cited by:

Related to: