vestifmИзвестия Национальной академии наук Беларуси. Серия физико-математических наукProceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series1561-24302524-2415The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"vestifm-101Research ArticleМАТЕМАТИКАMATHEMATICSО ВЫБОРЕ ПОЛИНОМОВ ДЛЯ АЛГОРИТМА РЕШЕТА ЧИСЛОВОГО ПОЛЯON THE CHOICE OF POLYNOMIALS FOR THE NUMBER FIELD SIEVEВасильевД. В.VasilyevD. V.КудинА. С.KudinA. S.Институт математики Национальной академии наук Беларуси, МинскInstitute of Mathematics of the National Academy of Sciences of Belarus, Minsk201418052016035459Copyright © Васильев Д.В., Кудин А.С., 20162016Васильев Д.В., Кудин А.С.Vasilyev D.V., Kudin A.S.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://vestifm.belnauka.by/jour/article/view/101

В работе предлагается методика для быстрой экспериментальной оценки времени просеивания и числа пар взаимно простых чисел, дающих гладкие значения полиномов для алгоритма решета числового поля.

In the paper an algorithm is suggested for quick estimate of sieving time and the number of relations for the number field sieve algorithm.

ReferencesRivest R., Shamir A., Adleman B. // Communications of the ACM. 1978. Vol. 21, iss. 2.Rivest R., Shamir A., Adleman B. // Communications of the ACM. 1978. Vol. 21, iss. 2.Vanstone S., Menezes A., Oorschot P. van. Handbook of Applied Cryptography. London, 1996.Vanstone S., Menezes A., Oorschot P. van. Handbook of Applied Cryptography. London, 1996.Diffie W., HellmanM. // Information Theory IEEE Transactions. 1976. Vol. 22 (2). P. 644-654.Diffie W., HellmanM. // Information Theory IEEE Transactions. 1976. Vol. 22 (2). P. 644-654.Buhler J. P., Lenstra H. W., Pomerance С. // Springer Berlin / Heidelberg, Lecture Notes in Mathematics. 1993. Vol. 1554. P. 50-94.Buhler J. P., Lenstra H. W., Pomerance С. // Springer Berlin / Heidelberg, Lecture Notes in Mathematics. 1993. Vol. 1554. P. 50-94.Pollard J. M. // Springer Berlin / Heidelberg, Lecture Notes in Mathematics. 1993. Vol. 1554. P. 43-49.Pollard J. M. // Springer Berlin / Heidelberg, Lecture Notes in Mathematics. 1993. Vol. 1554. P. 43-49.Lercier R., JouxA. // Mathematics of computation. 1999. Vol. 72. P. 953-967.Lercier R., JouxA. // Mathematics of computation. 1999. Vol. 72. P. 953-967.Murphy В. A. Polynomial Selection for the Number Filed Sieve Integer Factorization Algorithm. PhD thesis. The Australian National University, 1999.Murphy В. A. Polynomial Selection for the Number Filed Sieve Integer Factorization Algorithm. PhD thesis. The Australian National University, 1999.Kleinjung Th. // Math. Comp. 2006. Vol. 75. P. 2037-2047.Kleinjung Th. // Math. Comp. 2006. Vol. 75. P. 2037-2047.Monico C. GGNFS suite // sourceforge. net [Electronic resource]. 2012. Mode of access: http://sourceforge.net/projects/ggnfs/. Date of access: 17.09.2013.Monico C. GGNFS suite // sourceforge. net [Electronic resource]. 2012. Mode of access: http://sourceforge.net/projects/ggnfs/. Date of access: 17.09.2013.General number filed sieve implementation // sourceforge. net [Electronic resource]. 2012. Mode of access: http://gdlog. sourceforge.net/. Date of access: 17.09.2013.General number filed sieve implementation // sourceforge. net [Electronic resource]. 2012. Mode of access: http://gdlog. sourceforge.net/. Date of access: 17.09.2013.

The authors declare that there are no conflicts of interest present.