  A deterministic algorithm for factoring $n$ using $n^{1/3+o(1)}$ bit
operations is presented. The algorithm tests the divisibility of $n$ by all the
integers in a short interval at once, rather than integer by integer as in
trial division. The algorithm is implemented.
