Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Exoplanets Artists Albums Gazetteer Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Campo de número de peneira geral · Vinony

Home
Integer factorization algorithms
Campo de número de peneira geral

🌐Português

English Deutsch Español Français Italiano Nederlands Polski Português Русский فارسی ไทย 한국어 中文日本語

EntityQ140770· pop 18· linked from 116 articles

Campo de número de peneira geral

Also known as GNFS

o mais eficiente algoritmo clássico, conhecido por fatorar inteiros maiores do que 100 dígitos

Available in 18 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
Italiano
Catalan
Finnish

Connections

division algorithm

multiplication algorithm

Categories

Integer factorization algorithms

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

algebraic number field

Entity

International Standard Book Number

rational number

digital object identifier

greatest common divisor

sieve of Eratosthenes

Euclidean algorithm

algebraic number

distributed computing

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

special number field sieve

Entitydist 0.05

Quadratic sieve

Entitydist 0.17

Fermat's factorization method

Entitydist 0.24

Pollard's p − 1 algorithm

Entitydist 0.34

integer factorization

Entitydist 0.36

continued fraction factorization

Entitydist 0.38

RSA Factoring Challenge

Entitydist 0.39

computational number theory

Entitydist 0.40

Congruence of squares

Entitydist 0.40

table of Gaussian integer factorizations

Entitydist 0.40

sieve of Eratosthenes

Entitydist 0.41

fundamental theorem of arithmetic

Entitydist 0.44

What links here116 pages

multiplication algorithm

Lenstra elliptic curve factorization

embarrassingly parallel

Congruence of squares

Ancient Egyptian multiplication

P versus NP problem

sieve of Eratosthenes

Pollard's rho algorithm for logarithms

Lucas–Lehmer primality test

extended Euclidean algorithm

computational complexity theory

Pohlig–Hellman algorithm

Generating primes

Richard Schroeppel

Supersingular Isogeny Key Encapsulation

Lenstra–Lenstra–Lovász lattice basis reduction algorithm

baby-step giant-step