Key points are not available for this paper at this time.
We consider the simultaneously fast and in-place computation of the Euclidean polynomial modular remainder Math 1 with A and B of respective degrees n and m ≤ n. Fast algorithms for this usually come at the expense of a linear amount of extra temporary space. In particular, they require to first compute and store the whole quotient Q(X) such that A = BQ + R.
Dumas et al. (Mon,) studied this question.