Some observations to speed the polynomial selection in the number field sieve

نویسندگان

  • Min Yang
  • Qingshu Meng
  • Zhang-yi Wang
  • Huanguo Zhang
چکیده

If the yield of a polynomial pair is closely correlated with the coefficients of the polynomial pair, we can select polynomials by checking the coefficients first. This can speed the selection of good polynomials. In this paper, we aim to study the correlation between the polynomial coefficients and the yield of the polynomials. By heuristic analysis and some experiments, we find that the yield of polynomial with the ending coefficient containing many small primes is usually better than the one whose ending coefficient does not contain. The ending coefficient has closer correlation with the yield than the leading coefficient has. The number of real roots can be determined only by partial coefficients of the polynomial if it is skewed. All these observations can be used to speed the search of good polynomials for the number filed sieve.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tower Number Field Sieve Variant of a Recent Polynomial Selection Method

At Asiacrypt 2015, Barbulescu et al. performed a thorough analysis of the tower number field sieve (TNFS) variant of the number field sieve algorithm. More recently, Kim and Barbulescu combined the TNFS variant with several polynomial selection methods including the Generalised Joux-Lercier method and the Conjugation method proposed by Barbulescu et al. at Eurocrypt 2015. Sarkar and Singh (Euro...

متن کامل

Size Optimization of Sextic Polynomials in the Number Field Sieve

The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be modelled in terms of size and root properties. In this paper, we describe some methods to optimize the size property of sextic polynomials.

متن کامل

A Review on the Hydrodynamic Characteristics of the SPP Concerning to the Available Experimental Data and Evaluating Regression Polynomial Functions

Surface-piercing propellers have been widely used in light and high-speed vessels because of their superior performance. One of the major steps in propeller selection algorithm is the determination of thrust as well as torque hydrodynamic coefficients. For the purpose of simplifying design and selection procedure, some relations are presented for determining hydrodynamic coefficients in some st...

متن کامل

Root optimization of polynomials in the number field sieve

The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be modelled in terms of size and root properties. In this paper, we describe some algorithms for selecting polynomials with very good root properties. 1...

متن کامل

Montgomery's method of polynomial selection for the number field sieve

The number field sieve is the most efficient known algorithm for factoring large integers that are free of small prime factors. For the polynomial selection stage of the algorithm, Montgomery proposed a method of generating polynomials which relies on the construction of small modular geometric progressions. Montgomery’s method is analysed in this paper and the existence of suitable geometric p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012