Fast square-free decomposition of integers using class groups

TL;DR

This paper introduces a heuristic algorithm leveraging class groups of binary quadratic forms to efficiently decompose integers of the form n=a^2b, where b is square-free, significantly improving factoring speed for cryptographic applications.

Contribution

The paper presents the first heuristic expected-time algorithm for square-free decomposition using class groups, outperforming existing methods for certain cryptographic-sized integers.

Findings

Algorithm operates in heuristic expected time involving class group computations

Method is fastest known for factoring integers of the form n=a^2b with prime a, b

Applicable to cryptographic integers, enhancing factoring efficiency

Abstract

Let $n=a^2b$, where $b$ is square-free. In this paper we present an algorithm based on class groups of binary quadratic forms that finds the square-free decomposition of $n$, i.e. $a$ and $b$, in heuristic expected time: $$ \widetilde{\mathcal{O}}(L_{b}[1/2,1] \ln(n) + L_{b}[1/2,1/2] \ln(n)^2). $$ If $a,b$ are both primes of roughly the same cryptographic size, then our method is currently the fastest known method to factor $n$. This has applications in cryptography, since some cryptosystems rely on the hardness of factoring integers of this form.