Fast Arithmetics Using Chinese Remaindering

Details Fast Arithmetics Using Chinese Remaindering Fast Arithmetics Using Chinese Remaindering

2008-06-10

arxiv.org/abs/0806.1722v1

Computer Science

Data Structures and Algorithms

Scientific paper

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 \cite{Gathen-Shparlinski}, are described. An efficient refinement of the NC$^1$ division algorithm of Chiu, Davida and Litow \cite{Chiu-Davida-Litow} is given, where the number of moduli is reduced by a factor of $\log n$.

Affiliated with

Also associated with

No associations

Rating

Fast Arithmetics Using Chinese Remaindering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Arithmetics Using Chinese Remaindering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Arithmetics Using Chinese Remaindering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175488