Application of the basic module's foundation for factorization of big numbers by the Fеrmаt method
Journal Title: Восточно-Европейский журнал передовых технологий - Year 2018, Vol 6, Issue 4
Abstract
<p>The Fermat method is considered to be the best for factorization of numbers N=p×q in case of close p and q. Computational complexity of the basic algorithm of the method is determined by the number of check values of X when solving equation Y<sup>2</sup>=X<sup>2</sup>‑N, as well as by complexity of the arithmetic operations. To reduce it, it is proposed to consider admissible those of test values X, for which (X<sup>2</sup>–N)modbb is quadratic residue modulo bb, called basic. Application of basic foundation of module bb makes it possible to decrease the number of check X by the number of times, close to Z=bb/bb<sup>*</sup>, where bb<sup>* </sup>is the number of elements of set Т of the roots of equation (Ymodb)<sup>2</sup>modb=((Xmodb)<sup>2</sup>–Nmodb)modb, and Z is the acceleration coefficient.</p><p>It was determined that magnitude Z(N, bb) is affected by the value of residues Nmodp (at p=2, Nmod8 residues are used). The statement of the problem of finding bb with a maximum Z(N, bb) at restrictions for the amount of memory of the computer, where exponents of prime numbers – multipliers bb – are determined, and the method of its solution were proposed.</p><p>To decrease the number of arithmetic operations with big numbers, it was proposed that instead of them to perform the operations with the values of differences between the nearest values of elements T. Then arithmetic operations of multiplication and addition with big numbers are performed only in rare cases. And if we derive the square root of X<sup>2</sup>–N only in cases, where the values of (X<sup>2</sup>–N)modb will be quadratic residues for many foundations of module b, other than bb, the computational complexity of this operation can be neglected.</p>It was established that the proposed modified algorithm of the Fermat method for numbers 2<sup>1024</sup> ensures a decrease in computational complexity compared to the basic algorithm on average by 10<sup>7</sup> times
Authors and Affiliations
Stepan Vynnychuk, Yevhen Maksymenko, Vadym Romanenko
Keywords
Related Articles
- EP ID EP528266
- DOI 10.15587/1729-4061.2018.150870
- Views 86
- Downloads 0
Development of a mobile decision support system based on the smart method for android platform
<p>The work is devoted to the development of a mobile decision support system for solving the multiple criteria decision-making problems. To ensure the autonomous operation of the system, it was proposed to use a three-l...
Development of effective technique for the disposal of the Prunus armeniaca seed shells
We proposed a new technique for the disposal of solid plant waste in the food industry, specifically solid shell of Prunus armeniaca seeds, by oxidative treatment with a hydrogen peroxide solution in an acetic acid mediu...
Development of the analytical method of the general mathieu equation solution
<p>An analytical method for solving the general Mathieu differential equation in the initial form is proposed. The method is based on the corresponding exact solution, which is found for arbitrary numerical parameters of...
Revealing the effect of decreased energy intensity of grinding in a tumbling mill during self-excitation of auto-oscillations of the intrachamber fill
<p>We have investigated a possibility to perform comparative evaluation of the effectiveness of grinding process in a tumbling mill under conventional steady and self-excited auto-oscillatory flow modes of the intrachamb...
Determining the patterns of phase and structural transformations at carbonthermal reduction of molybdenum concentrate
<p>We have studied patterns in the influence of O/C in the charge on the content of C, O<sub>2</sub>, and Mo in metallized molybdenum concentrate after different temperatures of thermal treatment. it was determined that...