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 78
- Downloads 0
Аnalysis of operating modes of singlephase currentsource rectifier with rectangularstepped pulsewidth modulation
<p>The operating modes of the single-phase active current-source rectifier in the case of rectangular-stepped pulse-width modulation and load in the form of DC traction motor are investigated. The single-phase bridge rec...
Identification of distribution features of the instantaneous power components of the electric energy of the circuit with polyharmonic current
Many researchers pay attention to the problem of the distortion electric power. The known theoretical results that are reflected in the acting standards are reasonably criticized in the part of the distortion power gener...
Development of a physical-mathematical model for the process of crystallization of meat systems
<p>It is proven that the complex of processes that occur during freezing-defrosting of meat systems cannot be described within the framework of the theory of freezing out true solutions. A characteristic feature of meat...
Development of adaptive fuzzy-logic device for control under conditions of parametric non-stationarity
<p>We studied an automatic control system with the fuzzy adaptive device for setting parameters of the PI-controller under conditions of non-stationarity of parameters of the control object’s model. The relevance of pres...
Determining strength indicators for the bearing structure of a covered wagon's body made from round pipes when transported by a railroad ferry
Improving the efficiency of transportation process through international transport corridors promotes the development of interoperable systems. Successful functioning of the interoperability of transportation is possible...