Acceleration analysis of the quadratic sieve method based on the online matrix solving
Journal Title: Восточно-Европейский журнал передовых технологий - Year 2018, Vol 2, Issue 4
Abstract
<p>The algorithm for the<strong> </strong>online matrix solving<strong> </strong>is proposed. The rate of acceleration of the basic quadratic sieve method based on the online matrix solving<strong> </strong>is investigated. Acceleration of the quadratic sieve method will reduce the runtime, the complexity of the algorithm and expand the set of numbers, where this algorithm is the best.</p><p>It is shown that the modified algorithm has increased the number of successful decompositions. That is, the number of cases where the basic quadratic sieve (standard sieving interval and size of the factor base) failed to form a matrix to obtain a solution was reduced. This became possible due to the fact that in the modified algorithm there is no need to obtain all L<sup>a</sup>+2 B-smooth numbers prior to diagonalization of the matrix, as in the case of the basic method. Among other important characteristics of this method, it should be noted that when used, the same operations as in the basic quadratic sieve method are performed, only their order is changed. The computing complexity decreases if the set of B-smooth numbers, for which the power matrix vectors form a linearly dependent system, are found quickly.</p>According to the data obtained, the modified QS method, based on<strong> </strong>the online matrix solving, provides an acceleration of about 5.45 percent for numbers of 10<sup>130 </sup>in size. It is shown that improvements associated with solving the matrix cannot lead to a significant increase in the sieving interval. After all, the rate of acceleration decreases with increasing number N. Further improvement to the quadratic sieve method should be related to methods aimed at a significant reduction of the sieving interval and the size of the factor base, which in relative terms should be the greater, the higher N
Authors and Affiliations
Stepan Vynnychuk, Vitalii Misko
Determining the effective characteristics of a composite with hollow fiber at longitudinal elongation
<p>When solving problems on the mechanics of composites, it is convenient to use a composite model in the form of a continuous homogeneous medium with effective constants, which adequately reflect its most essential char...
Construction of methods to improve operational efficiency of an intermittent heat supply system by determining conditions to employ a standby heating mode
<p class="a">In the course of this study we defined conditions for the rational utilization of intermittent heat supply for public buildings of various types: administrative and educational institutions, and other public...
Examining the effect of production conditions at territorial logistic systems of milk harvesting on the parameters of a fleet of specialized road tanks
<p class="a"><span lang="EN-US">We have studied the influence of changing production conditions and components of transportation processes on the need in specialized vehicles in the milk harvesting systems. Based on the...
Adaptive control over nonlinear objects using the robust neural network FCMAC
The paper explores issues related to the application of artificial neural networks (ANN) when solving the problems on identification and control of nonlinear dynamic systems. We have investigated characteristics of the n...
Results of research into kinetic and energy parameters of convection fruit drying in a solar drying plant
<p class="a">We have improved a procedure for calculating the kinetic and energy parameters of the convection fruit drying process in a solar drying plant, based on which it is possible to analyze enhancement in the effe...