Let be a periodic linear recurring sequence of period mod p, where p is a prime number, over   its function of autocorrelation and Δ the discriminant of its characteristic polynomial [3, 5, 6].

The purpose of this paper is twofold: first, to give an estimate of the computational cost of  and second, to demonstrate that for and   thus allowing to reduce the computational cost of

algorithmic cost, Golomb criteria, Legendre symbol, pseudo-random sequences, shifted sequences.