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
Keywords
Related Articles
- EP ID EP527871
- DOI 10.15587/1729-4061.2018.127596
- Views 91
- Downloads 0
Experimental research into the influence of twospark ignition on the deflagration to detonation transition process in a detonation tube
<p>The paper reports a study into the initiation of detonation in pulse detonation engines. The chosen direction to resolve this issue is the use of detonation tubes with multifocal ignition. We applied two spark dischar...
Development of a genetic algorithm for placing power supply sources in a distributed electric network
<p>The problem of substantiation of developing complex distribution systems of electric power supply was considered as a hierarchy of problems at the first stage of which the problem of choosing a rational configuration...
Development of structures of the aircraft fire alarm system by means of nested modules
<p>Optimization of structures of information management systems is determined by the choice of such a functional structure that would ensure high reliability of information. When creating complex systems, there is the pr...
Study of the mathematical models of optimal partitioning for particular cases
<p>The basic problem of optimal sets partitioning (OSP) for the case, where a segment of a plane curve is a set, was stated. The problem is stated as follows: let us assume there is a segment of a plane curve, it is requ...
Formalization of selection of contract-organizational project delivery strategy
<p>The formalized system to select a strategy for the implementation of a capital construction project was developed. This is important because an error in making a strategic decision (in an intuitive rather than formali...