Geodesic
About sieving methods in the number field sieve algorithm
Trudy Instituta matematiki, Tome 17 (2009) no. 1, pp. 19-26.

Voir la notice de l'article provenant de la source Math-Net.Ru

Different sieving methods in the number field algorithm is presented: linear sieve, lattice sieve, continued fractions sieve. 
@article{TIMB_2009_17_1_a1,
     author = {O. V. Babul},
     title = {About sieving methods in the number field sieve algorithm},
     journal = {Trudy Instituta matematiki},
     pages = {19--26},
     publisher = {mathdoc},
     volume = {17},
     number = {1},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMB_2009_17_1_a1/}
}
TY  - JOUR
AU  - O. V. Babul
TI  - About sieving methods in the number field sieve algorithm
JO  - Trudy Instituta matematiki
PY  - 2009
SP  - 19
EP  - 26
VL  - 17
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMB_2009_17_1_a1/
LA  - ru
ID  - TIMB_2009_17_1_a1
ER  - 
%0 Journal Article
%A O. V. Babul
%T About sieving methods in the number field sieve algorithm
%J Trudy Instituta matematiki
%D 2009
%P 19-26
%V 17
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMB_2009_17_1_a1/
%G ru
%F TIMB_2009_17_1_a1
O. V. Babul. About sieving methods in the number field sieve algorithm. Trudy Instituta matematiki, Tome 17 (2009) no. 1, pp. 19-26. http://geodesic.mathdoc.fr/item/TIMB_2009_17_1_a1/

[1] Pollard J., Monte Carlo methods for index computation mod p, Mathematics of Computation, 32, 1978 | MR | Zbl

[2] Pollard J.M., Factoring with cubic integers, pringer-Verlag, 1988

[3] Lenstra A.K., Lenstra H.W., Manasse M.S., Pollard J.M., The Number Field Sieve, Lecture Notes in Math., 1990

[4] Gordon D., “Discrete logarithms in GF(p) using the number field sieve”, J. Discrete Math., 1993 | MR

[5] Buhler J.P., Lenstra H.W., Pomerance Jr.C., Factoring integers with the number field sieve, Lecture Notes in Math., 1993

[6] Schirokauer O., “Discrete logarithms and local units”, Phil. Trans. R. Soc. Lond., 1993 | MR | Zbl

[7] Crandall R., Pomerance C., Prime Numbers, Springer, 2001 | MR | Zbl

[8] Murphy B.A., Polynomial selection for the number field sieve integer factorisation algorithm, Ph. D. thesis, Australian National University, 1999

[9] Silverman R.D., Optimal parameterization of SNFS, RSA Laboratories, 2003 | Zbl

[10] Franke J., Kleinjung T., Continued fractions and lattice sieve, University of Bonn, 2005

[11] Cohen H., A Course in Computational Algebraic Number Theory, Springer, 2001 | MR