For three positive integers ai, aj , ak pairwise coprime, we present an algorithm that find the least multiple of ai that is a positive linear combination of aj , ak. The average running time of this algorithm is O(1). Using this algorithm and the chinese remainder theorem leads to a direct computation of the Frobenius number f(a1, a2, a3).

In this paper we analyze the cheating detection and cheater identification problems for the secret sharing schemes based on the Chinese remainder theorem (CRT ), more exactly for Mignotte [1] and Asmuth-Bloom [2] schemes. We prove that the majority of the solutions for Shamir’s scheme [3] can be translated to these schemes and, moreover, there are some interesting specific solutions.

In this paper, we first critically analyze two existing latticebased cryptosystems, namely GGH and Micciancio, and identify their drawbacks. Then, we introduce a method for improving the implementation of GGH using the Chinese Remainder Theorem (CRT). Furthermore, we also propose another cryptosystem optimized for CRT, drawing on the strengths of both cryptosystems. We provide a fair comparison...

We present an algorithm that finds polynomials with many roots modulo many primes by rotating candidate Number Field Sieve polynomials using the Chinese Remainder Theorem. We also present an algorithm that finds a polynomial with small coefficients among all integral translations of X of a given polynomial in ZZ[X]. These algorithms can be used to produce promising candidate Number Field Sieve ...

For three positive integers ai, aj , ak pairwise coprime, we present an algorithm that find the least multiple of ai that is a positive linear combination of aj , ak. The average running time of this algorithm is O(Loga1). Using this algorithm and the chinese remainder theorem leads to a direct computation of the Frobenius number f(a1, a2, a3).

This paper proposes an efficient frequency estimator based on Chinese Remainder Theorem for undersampled waveforms. Due to the emphasis on frequency offset recognition (i.e., frequency shift and compensation) of small-point DFT remainders, compared to estimators using large-point DFT remainders, it can achieve higher noise robustness in low signal-to-noise ratio (SNR) cases and higher accuracy ...

Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding ...