[RomanM]

-How does the refrigerator work?
-Grmmmmmmmmmm
Old joke.
b=mod(u^n,p); a=mod(b^n,p)
b^2-a 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.