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 95
- Downloads 0
Influence of elasticity of unbalance drive in vibration machines on its oscillations
<p>The dynamics of the vibration machine with unbalance vibration exciter taking into account the elasticity of its connection with the asynchronous motor is studied.</p><p>The expression describing torsional oscillation...
Development of models and research into tooling for machining centers
<p>We have constructed three-dimensional solid models for tool storage of the disk type (for 14 instruments) and the chain type for 32 tools, mounted onto the side surface of a machine column. We propose a 3D model of th...
Mathematical model of the reverse water postpurification at mining enterprises when using electromagnetic focusing of contaminants
This study addresses the post-purification of reverse water by the electromagnetic focusing of charged particles in contaminants of polychlorinated biphenyls at mining enterprises. We established functional dependences o...
Study into predicted efficiency of the application of hybrid solar collectors to supply energy to multi-apartment buildings
<p>This paper reports a study into efficiency of the application of hybrid solar collectors, which can simultaneously generate both electricity and thermal energy to supply power to multi-storey buildings. The novelty of...
Substantiation of choosing the design of a reactordust collector with two colliding flows
<p>The objects of this study are the dust collectors for dry gas purification ‒ devices in which hydrodynamic modes are implemented. Advantages of using such devices are: work with gases of high temperature, high degree...