Quote:
Originally Posted by science_man_88
I typoed, so no. in fact without being able to not crash Paridroid with more memory allocated or just stalling I may not even be to even properly run the test.
|
So instead of repeatedly computing x = x^2-2 (mod 2^p-1), you set x = 4 and repeatedly computed x^2-2 without updating x ... so your final result should be x = 4, which means your x==0 of the final result should have come up 'false'. You didn't notice that?