25 citations · 210 across the 59 of their papers we have counts for
Showing 2012 · cs.SCShow all
2 papers · 2 filters
cs.SC2012★ 9 cited
On Newton-Raphson iteration for multiplicative inverses modulo prime powers
Jean-Guillaume Dumas
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over -adic numbers gives a recurrence relation computing modular inverse modulo ,…
cs.SC2012★ 3 cited
Computational linear algebra over finite fields
Jean-Guillaume Dumas, Clément Pernet
We present here algorithms for efficient computation of linear algebra problems over finite fields.