general number field sieve

E2000704 UNEXPLORED

The general number field sieve is the most efficient known classical algorithm for factoring large integers, especially those used in modern cryptographic systems.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
general number field sieve canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Lenstra elliptic-curve factorization method → comparedTo → general number field sieve ⓘ