An algorithm for the chinese remainder problem

DOI10.1080/00207169708804586MaRDI QIDQ4384036zbMATH OpenOpenAlexFDO

Authors Jun Ma

Publication date 30 May 1999

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169708804586

zbMATH Keywords

algorithmsChinese remainder problem

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16)

Review text

The author gives algorithms, with proofs of their validity, for solving the Chinese Remainder Problem. Some examples, necessitating the use of multi-length routines, are given.

Cited in

(3)

• scientific article; zbMATH DE number 5524164 (Why is no real title available?)
• scientific article; zbMATH DE number 17620 (Why is no real title available?)
• Chinese remaindering for algebraic numbers in a hidden field

This page was built for publication: An algorithm for the chinese remainder problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384036)