Number Field Sieve: Polynomial Selection and Structure
How the number field sieve achieves its complexity, why polynomial selection matters so much, and the role of number field arithmetic.
Engineering / MathematicsModern Factoring Methods8 min readKV-MATH-0676
The number field sieve is the fastest known general factoring algorithm. Its advantage comes from examining much smaller numbers for smoothness, and how small those numbers are is determined entirely by the polynomial chosen.
The idea
Work simultaneously in the integers and in a number field, seeking pairs that are smooth on both sides. Combining such relations produces a congruence of squares as before.
Select polynomials→Sieve both sides→Linear algebra→Square root→Factor
Why the values are smaller
The source of the improvement
Method
Size of values tested
Quadratic sieve
Around the square root of the target
Number field sieve
Around a sub-exponential function far below that
Complexity ~ L_n(1/3, c)Against L(1/2) for the quadratic sieve.
Polynomial selection
Two polynomials with a common root modulo the target are chosen. One defines the number field; the other is typically linear. The quality of the choice dominates the total running time.
Polynomial selection
Search a large spaceMany candidate polynomial pairs are generated.
Score by sizeHow small the values will be over the sieving region.
Score by root propertiesWhether many small primes divide values often — this substantially raises smoothness.
Optimise locallyRefine the best candidates by small adjustments.
SelectThe best-scoring pair.
The algebraic side
Smoothness on the number field side means the corresponding ideal factors over a base of prime ideals. This is where the machinery of this collection enters directly.
Prime decomposition to build the algebraic factor base — see simple decomposition.
Class group and unit obstructions in the final square root step.
The square root of an algebraic number, a substantial computation in its own right.
Where it wins
The special variant
For targets of special algebraic form, a polynomial with very small coefficients is available immediately, and the method runs considerably faster. This is why numbers of special form are factored well beyond the general record size.
Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 10.5. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.
Handbook application: from concept to controlled practice
Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Number Field Sieve: Polynomial Selection and Structure. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.
The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.
Treat Number Field Sieve: Polynomial Selection and Structure as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—number, field, polynomial, selection, sieve—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.
For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.
A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.
Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.
Step-by-step operating method
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.
Worked-example protocol
Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope is understood
Common failure modes and recovery actions
1. Watch for
Using a theorem without checking every hypothesis.
Recovery: Return to the governing definition or requirement and restate the decision in one sentence.
2. Watch for
Treating a suggestive example as a proof of the general case.
Recovery: Separate evidence from assumption, assign an owner and set a date for validation.
3. Watch for
Changing notation or conventions part-way through an argument.
Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.
4. Watch for
Hiding a division-by-zero, convergence, finiteness or commutativity assumption.
Recovery: Record the consequence, decision and rationale, then update the controlled baseline.
5. Watch for
Reporting a computed result without a residual, substitution or structural check.
Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.
Review checklist
Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?
Questions for deeper application
What is the most important distinction a practitioner must preserve when applying Number Field Sieve: Polynomial Selection and Structure?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about number would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
