Further Comments on "Residue-to-Binary Converters Based on New Chinese Remainder Theorems"

2007/07/25 by Jean-Luc Beuchat, Beuchat, Jean-Luc
Computer Science · #FOS: Computer and information sciences #Other Computer Science (cs.OH) #cs.OH

paper · pdf · doi:10.48550/arxiv.0707.3732

arxiv created 2009/03/23 · arxiv updated 2009/12/01

Abstract

Ananda Mohan suggested that the first New Chinese Remainder Theorem introduced by Wang can be derived from the constructive proof of the well-known Chinese Remainder Theorem (CRT) and claimed that Wang's approach is the same as the one proposed earlier by Huang. Ananda Mohan's proof is however erroneous and we show here that Wang's New CRT I is a rewriting of an algorithm previously sketched by Hitz and Kaltofen.

Related

• Fast Arithmetics Using Chinese Remaindering
• Chinese Remainder Theorem Approach to Montgomery-Type Algorithms
• Generic design of Chinese remaindering schemes
• Robustness in Chinese Remainder Theorem
• A Robust Generalized Chinese Remainder Theorem for Two Integers