Abstract
We propose a new subexponential time integer factoring algorithm called SQUFOF2, based on ideas of D. Shanks and R. de Vogelaere. It begins by using a sieve like that in the multiple polynomial Quadratic Sieve to construct a square value of a binary quadr
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of the Polish Academy of Sciences Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
