Прискорення методу квадратичного решета на основі використання умовно В-гладких чисел
We will investigate the degree of acceleration of the basic quadratic sieve method based on the search for conditionally B-smooth numbers. An analysis is made of the influence, and the number of cases of using conditionally B-smooth numbers. It is shown that the modified algorithm based on the searc...
Збережено в:
| Дата: | 2018 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Українська |
| Опубліковано: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2018
|
| Теми: | |
| Онлайн доступ: | http://journal.iasa.kpi.ua/article/view/107581 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | System research and information technologies |
Репозитарії
System research and information technologies| Резюме: | We will investigate the degree of acceleration of the basic quadratic sieve method based on the search for conditionally B-smooth numbers. An analysis is made of the influence, and the number of cases of using conditionally B-smooth numbers. It is shown that the modified algorithm based on the search for conditionally B-smooth numbers allows to factor the number in those cases when the basic quadratic sieve algorithm (with the standard sieving interval and the size of the factor base) could not form a matrix for obtaining the solution. |
|---|