20211013, 17:28  #1 
Mar 2016
397 Posts 
a variation of pollard rho
A peaceful and pleasant night for you,
I present a variation of a pollard rho algorithm, limited to Mp, with use of a solution of the pell equation x²2y²=1. Easy to understand and short for programming. I need 3*3 multiplications for 4 gcds. Program in C is attached. Is this a progress compared to the pollard rho algorithm and mathematically sensefull ? 
20211107, 02:47  #2 
"Alexander"
Nov 2008
The Alamo City
2×401 Posts 
I missed the complex number unit in high school, so I won't comment on that (if anyone has good reading material for me, feel free to suggest). But the fact that you used Floyd's cyclefinding algorithm instead of Brent's, without giving justification why Brent's algorithm wouldn't work here (I think it would), implies that you haven't done enough research into modern (read: post1980) rho implementations, which makes it a little hard to take you seriously.

20211107, 22:35  #3  
"Jane Sullivan"
Jan 2011
Beckenham, UK
2×3×7^{2} Posts 
Quote:
https://www.mhprofessional.com/97800...bles2edgroup 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Large Prime Variation of QS  Sam Kennedy  Factoring  9  20121218 17:30 
The Fischbach Prime a mersenne variation  Carl Fischbach  Miscellaneous Math  28  20100720 06:54 
Integral Variation  flouran  Information & Answers  6  20090720 20:00 
Variation on a Martin Gardner puzzle  grandpascorpion  Puzzles  20  20070715 15:11 
Pollard Rho Help?  theta  Factoring  2  20050823 21:14 