Fast arithmetics using Chinese remaindering

In this paper, some issues concerning the Chinese remaindering representation are discussed. A new converting method, which is an efficient probabilistic algorithm based on a recent result of von zur Gathen and Shparlinski [J. von zur Gathen, I. Shparlinski, GCD of random linear forms, Algorithmica 46 (2006) 137-148], is described. An efficient refinement of the NC^1 division algorithm of Chiu, Davida and Litow [A. Chiu, G. Davida, B. Litow, Division in logspace-uniform NC^1, Theoret. Informatics Appl. 35 (2001) 259-275] is given, where the number of moduli is reduced by a factor of logn.

[1]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[2]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1986, SIAM J. Comput..

[3]  Igor E. Shparlinski,et al.  GCD of Random Linear Combinations , 2006, Algorithmica.

[4]  George Havas,et al.  GCD of Many Integers , 1999, COCOON.

[5]  Erich Kaltofen,et al.  Integer Division in Residue Number Systems , 1995, IEEE Trans. Computers.

[6]  Wendy Hall,et al.  The art of programming , 1987 .

[7]  Bruce E. Litow,et al.  Fast Parallel Arithmetic via Modular Representation , 1991, SIAM J. Comput..

[8]  Igor E. Shparlinski,et al.  GCD of Random Linear Forms , 2004, ISAAC.

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Andrew Chiu,et al.  Division in logspace-uniform NC1 , 2001, RAIRO Theor. Informatics Appl..