ABSTRACT
Fast integer factorization is a problem not yet solved for arbitrary integers. Integer factorization methods are algorithms that find the prime divisors of any positive integer. The goal of this dissertation is to survey integer factorization algorithms and specifically the General Number Field Sieve algorithm. In this work, we outlined integer factorization methods. In particular, we consider the General Number Field Sieve (GNFS), the current fastest known algorithm for factorizing integers (Lage integers).
Simanjilo, E (2021). A Survey Of Integer Factorization Algorithms. Afribary. Retrieved from https://track.afribary.com/works/a-survey-of-integer-factorization-algorithms
Simanjilo, Emanuel "A Survey Of Integer Factorization Algorithms" Afribary. Afribary, 10 May. 2021, https://track.afribary.com/works/a-survey-of-integer-factorization-algorithms. Accessed 27 Nov. 2024.
Simanjilo, Emanuel . "A Survey Of Integer Factorization Algorithms". Afribary, Afribary, 10 May. 2021. Web. 27 Nov. 2024. < https://track.afribary.com/works/a-survey-of-integer-factorization-algorithms >.
Simanjilo, Emanuel . "A Survey Of Integer Factorization Algorithms" Afribary (2021). Accessed November 27, 2024. https://track.afribary.com/works/a-survey-of-integer-factorization-algorithms