Titlebook: Advances in Cryptology - ASIACRYPT 2003; 9th International Co Chi-Sung Laih Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 2

不真

S. Z. Abdel-Rahman,M. Paolini,M. S. Legatorse Remainder Theorem. We also present an algorithm that finds a polynomial with small coefficients among all integral translations of . of a given polynomial in ℤ[X]. These algorithms can be used to produce promising candidate Number Field Sieve polynomials.

handle

P. Nicolopoulou-Stamati,L. Hens,N. Larebekethm computations) is a variant of the quadratic sieve factoring algorithm. Paradoxical as it sounds, the principles of the number field sieve, in a strict sense, could not be applied to number field computations, yet. In this article we give an indication of the obstructions..In particular, we first

GRAVE