KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Schnorr-Lenstra Class Group Factoring MethodEngineering · Engineering MathematicsLesson 869/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin JoginSchnorr Lenstraclass groupfactoringauxiliary group
On this page

Ask about this page

KEVOS AIThe Schnorr-Lenstra Class Group Factoring Method

KEVOS knowledge first · trusted web sources when needed

Modern Factoring Methods

The Schnorr-Lenstra Class Group Factoring Method

Factoring via class groups of quadratic orders, and its place as the conceptual bridge to the elliptic curve method.

Engineering / MathematicsModern Factoring Methods2 min readKV-MATH-0667

The Schnorr-Lenstra method factors by computing in the class group of a quadratic order attached to the target. Its importance is conceptual: it made explicit the idea of an auxiliary group whose order can be varied.

The idea

Choose a discriminant involving the target and a multiplier. If the class number of that discriminant is smooth, the group structure can be exploited to produce an ambiguous form, which factors the discriminant.

Key point

The essential move is that the class number varies with the multiplier. If one multiplier gives an unfavourable class number, another can be tried — the same escape that Pollard's p-1 method lacks.

The algorithm

Schnorr-Lenstra class group factoring

  1. Choose a multiplierForming a discriminant from the target.
  2. Work in the class groupUsing composition and reduction.
  3. Raise to a smooth exponentThe product of prime powers below a bound, as in p-1.
  4. Look for an ambiguous formOne equal to its own inverse.
  5. Extract the factorAn ambiguous form gives a factorisation — see Shanks's method.
  6. RetryWith a different multiplier if unsuccessful.

The complexity

Cost ~ L_n(1/2, c)Sub-exponential, from the smoothness of the class number.

Note

The class number of an imaginary quadratic order is roughly the square root of the discriminant, so it is a large number whose smoothness is a matter of chance — exactly the situation the Dickman analysis addresses.

Why ECM superseded it

Class group factoring versus ECM
AspectClass group methodECM
Auxiliary groupClass group of a quadratic orderElliptic curve group modulo n
Group order variesWith the multiplierWith the curve
Order sizeRoughly the square root of the targetRoughly the size of the unknown prime factor
Arithmetic costComposition and reduction — expensiveA few modular multiplications
Depends onThe size of the targetThe size of the factor

Key point

The decisive difference is the size of the auxiliary group. The class group's order relates to the target; the curve group's order relates to the unknown prime factor. That is why ECM's cost depends on the factor size and this method's does not.

The conceptual line

Pollard p-1→Shanks class group→Schnorr-Lenstra→Elliptic curve method

Each step generalises the auxiliary group and gains flexibility. ECM is the end of the line for this idea, and the sieves take an entirely different route — see elliptic curves modulo N.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 10.2. 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.

Related pages

  • Shanks's Class Group Factoring Method
  • The Continued Fraction Factorisation Method
  • Elliptic Curves Modulo N

Continue learning

The Continued Fraction Factorisation MethodArticle · Engineering MathematicsNEXT LESSON →Elliptic Curves Modulo NArticle · Engineering MathematicsSmoothness and Sub-exponential ComplexityArticle · Engineering MathematicsElliptic Curve Arithmetic Modulo NArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®