110 search results - page 1 / 22 » Chinese Remaindering with Errors |
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 ...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Traditional channel quantization based methods for encryption key generation usually suffer from the quantization error which may decrease the key agreement ratio between authoriz...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime inte...
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...
CCS
2004
ACM
13 years 9 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...