Development of Large Numbers Factorization Algorithm

The paper analyzes existing factorization algorithms and classifies them. The elaboration of the factorization algorithm which allows working with both small and large numbers is presented. Whereas the replacement of operations of addition and multiplication by the operation of addition, in comparis...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2019 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS) Ročník 2; s. 1078 - 1081
Hlavní autoři: Illiashenko, Oleg, Pevnev, Vladimir
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2019
Témata:
algorithm complexity
Classification algorithms
Complexity theory
Conferences
Elliptic curves
factorization algorithms
IEC Standards
ISO Standards
numerical methods
organization of calculations
primes
Task analysis
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The paper analyzes existing factorization algorithms and classifies them. The elaboration of the factorization algorithm which allows working with both small and large numbers is presented. Whereas the replacement of operations of addition and multiplication by the operation of addition, in comparison with the existing algorithms, a large gain of time is achieved. The initiation of operation of inequality solution allows cutting up to N 1/4 of possible candidates for a single calculation step. The evaluation of the time of the algorithm was conducted. It is comparable to the best known.
DOI:10.1109/IDAACS.2019.8924341