General number field sieve
General number field sieve
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10100. Heuristically, its complexity for factoring an integer
Excerpt from the Wikipedia article “General number field sieve”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add General number field sieve to your collection.
Play for free




