Fast Arithmetics Using Chinese Remaindering
Data Structures and Algorithms
2008-06-11 v1
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 \cite{Gathen-Shparlinski}, are described. An efficient refinement of the NC division algorithm of Chiu, Davida and Litow \cite{Chiu-Davida-Litow} is given, where the number of moduli is reduced by a factor of .
Keywords
Cite
@article{arxiv.0806.1722,
title = {Fast Arithmetics Using Chinese Remaindering},
author = {George Davida and Bruce Litow and Guangwu Xu},
journal= {arXiv preprint arXiv:0806.1722},
year = {2008}
}