RUS  ENG
Full version
JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive

Izv. Vyssh. Uchebn. Zaved. Mat., 2011 Number 4, Pages 15–22 (Mi ivm7287)

This article is cited in 2 papers

One approach to factorization of positive integers

A. A. Boiko, D. B. Ziyatdinov, Sh. T. Ishmukhametov

Chair of Systems Analysis and Informational Technologies, Kazan State University, Kazan, Russia

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.

UDC: 511.218+510.17

Received: 15.10.2009


 English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2011, 55:4, 12–17

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026