Computing square roots modulo prime powers

I'm writing a program that will do this. I was looking on Wikipedia for methods to do this and I got this sentence: "If the modulus $\displaystyle n$ is a prime power $\displaystyle n^{pe}$, a solution may be found ($\displaystyle \mod p$) and "lifted" to a solution ($\displaystyle \mod n$) using Hensel's lemma or an algorithm of Gauss.[8]" ([8] Gauss, DA, art. 101)

Does anyone know what algorithm of Gauss they are referring to? I don't have the book. Thanks.