The Function Field Sieve (FFS) is an algorithm used for factoring large integers, particularly those that are difficult to factor with classical methods. It extends the ideas of the number field sieve (NFS), which is currently one of the most efficient known methods for factoring large composite numbers, especially those with large prime factors.
Articles by others on the same topic
There are currently no matching articles.