![]() |
![]() |
#1 |
Mar 2016
22×32×11 Posts |
![]()
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 ? ![]() ![]() ![]() |
![]() |
![]() |
![]() |
#2 |
"Alexander"
Nov 2008
The Alamo City
25·52 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 cycle-finding 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: post-1980) rho implementations, which makes it a little hard to take you seriously.
|
![]() |
![]() |
![]() |
#3 | |
"Jane Sullivan"
Jan 2011
Beckenham, UK
22×73 Posts |
![]() Quote:
https://www.mhprofessional.com/97800...bles-2ed-group |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Large Prime Variation of QS | Sam Kennedy | Factoring | 9 | 2012-12-18 17:30 |
The Fischbach Prime a mersenne variation | Carl Fischbach | Miscellaneous Math | 28 | 2010-07-20 06:54 |
Integral Variation | flouran | Information & Answers | 6 | 2009-07-20 20:00 |
Variation on a Martin Gardner puzzle | grandpascorpion | Puzzles | 20 | 2007-07-15 15:11 |
Pollard Rho Help? | theta | Factoring | 2 | 2005-08-23 21:14 |