Quadratic sieve acceleration based on the search of additional B-smooth numbers
DOI:
https://doi.org/10.15587/2313-8416.2017.118298Keywords:
quadratic sieve method, additional B-smooth numbers, factor base, sieving intervalAbstract
The quadratic sieve method is the fastest for integers under 100 decimal digits or so. To get the best speed and less amount of memory it is necessary to successfully choose the size of factor base and sieving interval. This paper describes method, which will allow to reduce size of factor base and sieving interval without reducing the size of B-smooth numbers
References
Gorbenko, I. D., Dolgov, V. I., Potiy, A. V., Fedorchenko, V. N. (1995). Analiz kanalov uyazvimosti sistemy RSA. Bezopasnost' informatsii, 2, 22–26.
Brown, D. R. L. (2005). Breaking RSA May Be As Difficult As Factoring. Cryptology ePrint Archive. Available at: https://eprint.iacr.org/2005/380
Pomerance, C. (1985). The quadratic sieve factoring algorithm. Lecture Notes in Computer Science, 169–182. doi: 10.1007/3-540-39757-4_17
Lindquist, E. (2001). The Quadratic Sieve Factoring Algorithm. Math 488: Cryptographic Algorithms, Diciembre.
Song, Y. (2009). Quadratic Sieve. Primality Testing and Integer Factorization in Public-Key Cryptography. New York: Springer, 234–239.
Diffie, W., Hellman, M. (1976). New directions in cryptography. IEEE Transactions on Information Theory, 22 (6), 644–654. doi: 10.1109/tit.1976.1055638
Shenkhage, A., Shtrassen, V. (1973). Bystroe umnozhenie bol'shikh chisel. Kiberneticheskiy sbornik, 2, 87–98.
Pomerance, C. (1982). Analysis and comparison of some integer factoring algorithms. Mathematisch Centrum Computational Methods in Number Theory, 1, 89–139.
Pomerance, C. (2008). Smooth numbers and the quadratic sieve. Proc. of an MSRI workshop, 69–81.
Crandall, R., Pomerance, C. (2005). Smooth numbers and the quadratic sieve. Prime Numbers A Computational Perspective. New York: Springer, 261–315.
Downloads
Published
Issue
Section
License
Copyright (c) 2017 Vitalii Misko
This work is licensed under a Creative Commons Attribution 4.0 International License.
Our journal abides by the Creative Commons CC BY copyright rights and permissions for open access journals.
Authors, who are published in this journal, agree to the following conditions:
1. The authors reserve the right to authorship of the work and pass the first publication right of this work to the journal under the terms of a Creative Commons CC BY, which allows others to freely distribute the published research with the obligatory reference to the authors of the original work and the first publication of the work in this journal.
2. The authors have the right to conclude separate supplement agreements that relate to non-exclusive work distribution in the form in which it has been published by the journal (for example, to upload the work to the online storage of the journal or publish it as part of a monograph), provided that the reference to the first publication of the work in this journal is included.
