← LibraryThe Schnorr-Lenstra Class Group Factoring MethodEngineering · MathematicsLesson 370/385← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin JoginSchnorr Lenstraclass groupfactoringauxiliary group

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.

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.

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

The conceptual line

Pollard p-1Shanks class groupSchnorr-LenstraElliptic 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.

Continue learning

The Continued Fraction Factorisation MethodArticle · MathematicsNEXT LESSON →Elliptic Curves Modulo NArticle · MathematicsSmoothness and Sub-exponential ComplexityArticle · MathematicsElliptic Curve Arithmetic Modulo NArticle · Mathematics