Pascal Molin on Wed, 09 Apr 2014 14:32:43 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: index calculus vs pollard rho

2014-04-09 13:59 GMT+02:00 Georgi Guninski <>:
Are you sure this is not pure luck and this
works for sufficiently man 120 bit primes?

This appears slow for me:

p=nextprime(2^120-2^60); znlog(Mod(3,5*p)^(4),Mod(2,5*p)^(4),p-1)

This depends on the fact that p-1 has relatively small factors. This is not the case
on most examples, of course, and mine was chosen on purpose.