most citedUsing the smoothness of p-1 for computing roots modulo p

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

math.NT2008★ 2 cited

Using the smoothness of p-1 for computing roots modulo p

Bartosz Zralek

We prove, without recourse to the Extended Riemann Hypothesis, that the projection modulo of any prefixed polynomial with integer coefficients can be completely factored in det…