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 70
- Downloads 0
Analytical and experimental studies into the processes of hydrodynamics and heat exchange in the channels of disk pulse devices
<p>The paper reports an analytical study into the influence of basic parameters of channels in the pulse disk devices on the efficiency of processes of heat exchange and hydrodynamics under the pulse effect on a heat-car...
Construction and analysis of the model for stochastic optimization of inventory management at a ship repair yard
<p>A stochastic model of work of inventory management system at a ship repair yard (SRY) has been developed. In order to account for factors related to uncertainties and risks (random moments of arrival of ships at SRY,...
Classification rule hierarchical tuning with linguistic modification based on solving fuzzy relational equations
<p>The common problem with the hierarchical tuning methods is the lack of conditions for modification of the primary rules. The incremental approach accelerates the generation of candidate rules, but complicates the sele...
Influence of grain processing products on the indicators of frozen milkprotein mixtures
<p class="a">This paper reports a study into the influence of manna groats and extruded manna groats on the qualitative and quantitative indicators of milk and protein concentrates over a freezing–defrosting cycle. A sli...
An algorithm of selecting the pricing model for a construction contract
<p>An algorithm has been developed for selecting a price model for a construction contract. This is important because price is one of the key parameters of a contract. It is this parameter that determines how much of the...