Sieving polynomial for factorization of numbers of the form n = m^5 + a_4m^4 + a_3m^3 + a_2m^2 + a_1m + a_0 for a_i << m
Abstract
In the process of factorization of general integers in 1998 Zhang developed a method which can factor integers of the form $n = m^3+a_2m^2+a_1m+a_0$ for $a_i<
Copyright © 2019 P. Anuradha Kameswari, G. Surya Kantham. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
P. A. Kameswari, G. S. Kantham, Sieving polynomial for factorization of numbers of the form n = m^5 + a_4m^4 + a_3m^3 + a_2m^2 + a_1m + a_0 for a_i << m, J. Math. Comput. Sci. 9 (2019), 784–795. https://doi.org/10.28919/jmcs/4240
BibTeX
@article{Kameswari2019,
author = {Kameswari, P. Anuradha and Kantham, G. Surya},
title = {Sieving polynomial for factorization of numbers of the form n = m^5 + a_4m^4 + a_3m^3 + a_2m^2 + a_1m + a_0 for a_i << m},
journal = {J. Math. Comput. Sci.},
volume = {9},
year = {2019},
pages = {784--795},
doi = {10.28919/jmcs/4240}
}