I don't want to log to github, but the expected behavior of raising exception if there is no solution in the bound is entirely correct despite the doubtful comment. The running times of some of the algorithms heavily depend on the bounds and it is significantly faster if the bound is small.
On Sun, Jun 30, 2024 at 7:14 PM dmo...@deductivepress.ca <dmor...@deductivepress.ca> wrote: > > I opened an issue at github #38316. Let's continue the discussion there. > > On Sunday, June 30, 2024 at 12:09:48 PM UTC-4 Georgi Guninski wrote: >> >> I think the problem is abusing the factorization of the group order >> and later doing CRT. >> >> The following code correctly raises exception: >> >> dl3=discrete_log_lambda(a,g,bounds=(1,p.isqrt())) >> ValueError: Pollard Lambda failed to find a log > > -- > You received this message because you are subscribed to the Google Groups > "sage-devel" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to sage-devel+unsubscr...@googlegroups.com. > To view this discussion on the web visit > https://groups.google.com/d/msgid/sage-devel/cd319d22-e0ac-45fe-963e-5d6e481615f9n%40googlegroups.com. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/CAGUWgD_%2Bvyiho_BrOrMqW7Z1yYdxfv0UY4YVg6YdyUsRqy6oGA%40mail.gmail.com.
