Fast Arithmetics Using Chinese Remaindering
Abstract
In this paper, some issues concerning the Chinese remaindering representation are discussed. Some new converting methods, including an efficient probabilistic algorithm based on a recent result of von zur Gathen and Shparlinski Gathen-Shparlinski, are described. An efficient refinement of the NC1 division algorithm of Chiu, Davida and Litow Chiu-Davida-Litow is given, where the number of moduli is reduced by a factor of n.
0