Подробное описание документа

Захаров А. С.
   Разложение на множители целых чисел путем вычисления коэффициентов биноминала = Integer Factoryzing by Computing Binomail Coefficients / Захаров А. С. // Наука, технологии и бизнес : материалы 6-ой Межвузовской конференции аспирантов, соискателей и молодых учёных, Москва, 16-18 апреля 2024 года / МГТУ им. Н. Э. Баумана (национальный исследовательский университет). - М., 2024. - С. 192-197.

In this article introduce and analyze the algorithm for factoring integers by polynomial complexity of the length the factored integer. Note a strong assumption about the oracle for efficiently computing the value of the binomial coefficient. The article is of theoretical interest, a new approach to factorization of numbers. In the article defines mathematical statement problem for factorizing numbers and it is solved by introducing the function for computing the greatest common divisor between factorizing number and semi-interval of two powers of 2. Such approach looks as good new idea for factorizing numbers by polynomial complexity but with strong assumption of existing efficient algorithm for computing binomial coefficients.
Keywords: factorization, binomial coefficient, cryptography