View Single Post
Old 2021-10-13, 17:28   #1
bhelmes's Avatar
Mar 2016

397 Posts
Default 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 ?

Attached Files
File Type: cpp fac_pell_mers_3.cpp (5.4 KB, 81 views)
bhelmes is online now   Reply With Quote