Quote:
Originally Posted by RomanM
b=mod(u^n,p); a=mod(b^n,p)
b^2a is a multiple of p for any integer n>0, I don't know the behavior of epsilon for every n, but seems that algorithm work only if n=2.

Try going through the same calculations that I did, but with n=3 and the square roots replaced with cube roots. Can you see where things change?