De Éric Schost
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.
De Joachim von zur Gathen
De Sébastien Tavenas
De Pranjal Dutta
De Nitin Saxena
De Clément Pernet
De Fredrik Johansson
De Lihong Zhi
De Annie Cuyt
De Juan Camilo Arosemena Serrato
De Giuseppe Savaré
De Juan Camilo Arosemena Serrato
De Shirly Geffen
De Francesca Arici
De Amine Marrakchi
