Improvement of the quadratic sieve method on the basis of the extended factor base and using available quantity of B – smooth numbers

Authors

• Stepan Vynnychuk Pukhov institute for modeling in energy engineering of National academy of sciences of Ukraine; National technical university of Ukraine “Igor Sikorsky Kyiv polytechnic institute”, Kyiv,
• Vitalii Misko Pukhov institute for modeling in energy engineering of National academy of sciences of Ukraine, Kyiv,

Keywords:

Quadratic sieve, extended factor base, available quantity of B-smooth, sieving interval, prime numbers.

Abstract

In information and telecommunication systems, RSA algorithms are often used to solve information security problems. At the core of the cryptostability of the most popular today asymmetric cryptographic algorithm RSA is the complexity of the factorization of large integers. Quadratic sieve method is the best for factorization of integers under 110 decimal digits or so.  The most time consuming part of the algorithm of a quadratic sieve is the sieving process. The size of the factor base is one of the key parameters that determine the effectiveness of the sieving algorithm. Too large factor base requires the search for a large number of Bsmooth numbers, which increases the total execution time of the algorithm. When the size is less than necessary, it will not be possible to find a sufficient number of Bsmooth numbers. In this paper, the method for determining and applying a sufficient size of Bsmooth numbers with doubling the factor base size in comparison with the basic algorithm of a quadratic sieve is proposed. With the expansion of the factor base, the number of N numbers increases, which can be decomposed into factors by the quadratic sieve method. It is also noted that its increase leads to an increase in computational complexity, since it is advisable to find a greater number of Bsmooth numbers. However, when conducting numerical experiments, where the size of the factor base increased twice, it turned out that using the proposed algorithm, the time necessary to find a sufficient number of B-smooth numbers, on the contrary, decreased.

Author Biographies

Stepan Vynnychuk, Pukhov institute for modeling in energy engineering of National academy of sciences of Ukraine; National technical university of Ukraine “Igor Sikorsky Kyiv polytechnic institute”, Kyiv,

doctor of technical science, senior researcher;
professor at the cybersecurity and application
of information systems and technologies

References

C. Pomerance, “The quadratic sieve factoring algorithm”, in Proc. of EUROCRYPT 84. A Workshop on the Theory and Application of Cryptographic Techniques, Paris, 1984. pp. 169-182.

doi: 10.1007/3-540-39757-4_17.

Landquist E. “The Quadratic Sieve Factoring Algorithm”. [Online]. Available: http://www.cs.virginia.edu/crab/QFS_Simple.pdf . Accessed on: Sept. 19, 2017.

C. Pomerance “Analysis and comparison of some integer factoring algorithms”, in Computational Methods in Number Theory, vol. 154, Amsterdam, Netherlands: Math. Centre Amsterdam, 1982, pp. 89-139.

C. Pomerance, “Smooth numbers and the quadratic sieve”, Algorithmic Number Theory, vol. 44, pp. 69-81, 2008.

Y.Y.Song, Primality testing and integer factorization in public-key cryptography, New York, USA: Springer Publishing, 2009.

doi: 10.1007/978-0-387-77268-4.

R. Crandall, and C. Pomerance, Prime Numbers. A Computational Perspective, New York, USA: Springer Publishing, 2005.

I.D Gorbenko, V.I. Dolgov, A.V. Potiy, and V.N. Fedochenko, “Analysis of RSA system vulnerability channels”, Information security, no. 2, pp. 22-26, 1995.

Daniel R. L. Brown, “Breaking RSA may be as difficult as factoring”. [Online]. Available: https://eprint.iacr.org/2005/380.pdf. Accessed on: Sept. 19, 2017.

2017-12-31

How to Cite

Vynnychuk, S., & Misko, V. (2017). Improvement of the quadratic sieve method on the basis of the extended factor base and using available quantity of B – smooth numbers. Information Technology and Security, 5(2), 67–75. https://doi.org/10.20535/2411-1031.2017.5.2.136966

Section

СOMPUTATIONAL METHODS