01:06:12
published on May 12, 2026
Bulles de savons, équations d'Einstein et structure de l'espace temps
By Jean-Pierre Demailly
Coppersmith’s algorithm and polynomial equations
By Éric Schost
Appears in collection : 2023 - T3 - WS1 - Fundamental algorithms and algorithmic complexity
Coppersmith's generalization of Wiedemann's algorithm is a key ingredient in algorithms for integer factorization or discrete logarithms. I will describe how, in recent years, it has also successfully been applied in contexts arising from algorithms for polynomial equations, such as sparse FGLM algorithms, or modular composition.
