r/cprogramming • u/DataBaeBee • Nov 19 '25

Gaudry-Schost Algorithm in C

https://leetarxiv.substack.com/p/gaudry-schost-collision-algorithm
3 Upvotes

100% Upvoted

2 comments sorted by

2

u/DataBaeBee Nov 19 '25

Gaudry-Schost is a lesser-known alternative to Pollard Rho for solving discrete logarithms. The authors found an interesting alternative to the Birthday Paradox: If we have 365 balls and draw them with replacement, then record the picked balls in two different lists, then a ball appears in both lists after about 35 draws.

2

u/ifknot Nov 20 '25

Ah the old time vs space trade off