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 51
- Downloads 0
Procedure for modeling dynamic processes of the electromechanical shock absorber in a subway car
<p>A procedure has been devised for modeling the dynamic processes in the proposed structure of an electromechanical shock absorber. Such shock absorbers can recuperate a part of the energy of oscillations into electrica...
Astabilizing system for butter pastes based on the dry concentrates of milk protein
<p>The composition of the stabilizing system for butter pastes based on dry concentrates of milk and whey proteins has been substantiated; that would help reduce the deficiency of protein in the diet of modern human and...
Development of the method of structural and parametric synthesis of the Quanton diagnostic and health complex
<p>The synthesis method based on the use of information invariants is proposed, and structural-parametric synthesis of the Quanton diagnostic and health complex is performed. Structural and parametric optimization of the...
Geometric modeling of the unfolding of a rod structure in the form of a double spherical pendulum in weightlessness
<p>We investigated the geometric model of the new technique for unfolding a rod structure, similar to the double spherical pendulum, in weightlessness. Displacements of elements occur due to the pulses from pyrotechnic j...
Studying the physicalchemical transformations at resourcesaving reduction melting of chrome–nickelcontaining metallurgical waste
<p>We have investigated the physicochemical characteristics of chromium-nickel-containing waste from the production of corrosion-resistant steels and a doped alloy obtained by reduction smelting. This is necessary to det...