This talk is motivated by the problem of factoring large
numbers, which requires the solution of sparse systems of billlions of
equations in billions of variables. The standard techniques such as Gauss
elimination cannot handle these sizes, and in this talk I will present new
algorithms and their efficient implementations which are particularly
suitable for special purpose hardware. The talk will be self contained,
requiring no special knowledge of cryptography or factoring algorithms.