ECCC
1998
13 years 4 months ago
1998
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...
RTSS
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
CCS
2004
ACM
13 years 10 months ago
2004
ACM
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
AICCSA
2005
IEEE
13 years 10 months ago
2005
IEEE
A new scheme for transmitting sensitive data is proposed, the proposed scheme depends on partitioning the output of a block encryption module using the Chinese Remainder Theorem a...
QUANTUMCOMM
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper, we first critically analyze two existing latticebased cryptosystems, namely GGH and Micciancio, and identify their drawbacks. Then, we introduce a method ...