Abstract:
Factorization of positive integers into primes is a hard computational task. Its complexity lies in the base of the most popular method of cryptography, the RSA method. In this paper we propose a new technique in a factorization procedure which combines ideas of the Number Field Sieve (NFS) and the Quadratic Sieve (QS) in a special manner.
Keywords:
QS, NFS, number field sieve, quadratic sieve, factorization.
Citation:
A. A. Boiko, D. B. Ziyatdinov, Sh. T. Ishmukhametov, “One approach to factorization of positive integers”, Izv. Vyssh. Uchebn. Zaved. Mat., 2011, no. 4, 15–22; Russian Math. (Iz. VUZ), 55:4 (2011), 12–17