test for primality of Mersenne numbers

Suppose $p$ is an odd prime, and define a sequence $L_n$ recursively as

$$L_0=4,L_{n+1}=(L_n^2-2)mod(2^p-1).$$

The number $2^p-1$ is prime if and only if $L_{p-2}=0$.