One of Euler's discoveries was if an integer $n$ can be represented as a sum of two squares in two distinct ways, then one can factor $n$ explicitly.
Of course, the method was ineffective as an algorithm, but I was wondering if anyone knew of a similar method for factoring integers using a sum of four squares representation.