Engineering↗
Factor Base Selection and Smoothness
Choosing the factor base for class group computation, the smoothness trade-off, and how base size interacts with the linear algebra.
Every page in the KEVOS library tagged smoothness. 5 pages.
Choosing the factor base for class group computation, the smoothness trade-off, and how base size interacts with the linear algebra.
How the number field sieve achieves its complexity, why polynomial selection matters so much, and the role of number field arithmetic.
Smooth numbers, the Dickman function, and how balancing smoothness probability against factor base size produces sub-exponential running times.
Sub-exponential class group and regulator computation for quadratic fields by relation collection over a factor base.
Pollard's p-1 method, its dependence on the smoothness of the group order, and why that dependence is its fatal limitation.