English Wikipedia - The Free Encycl...
Download this dictionary
General number field sieve
In
number theory
, the
general number field sieve
(
GNFS
) is the most
efficient
classical
algorithm
known for
factoring integers
larger than 100 digits.
Heuristically
, its
complexity
for factoring an integer (consisting of bits) is of the form
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License