View Single Post
Old 2021-07-29, 18:48   #13
charybdis
 
charybdis's Avatar
 
Apr 2020

547 Posts
Default

Quote:
Originally Posted by RomanM View Post
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.
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?
charybdis is offline   Reply With Quote