Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Noisy Chinese remaindering in the Lee norm
Journal of Complexity - Special issue on coding and cryptography
Generalized Mignotte's Sequences Over Polynomial Rings
Electronic Notes in Theoretical Computer Science (ENTCS)
General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Electronic Notes in Theoretical Computer Science (ENTCS)
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Multi-frequency Phase Unwrapping from Noisy Data: Adaptive Local Maximum Likelihood Approach
SCIA '09 Proceedings of the 16th Scandinavian Conference on Image Analysis
IEEE Transactions on Signal Processing
A closed-form robust chinese remainder theorem and its performance analysis
IEEE Transactions on Signal Processing
Efficient privacy preserving k-means clustering
PAISI'10 Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics
Lattice-based threshold-changeability for standard CRT secret-sharing schemes
Finite Fields and Their Applications
Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
Information Sciences: an International Journal
Information Processing Letters
| Hi-index | 754.84 |
The Chinese remainder theorem states that a positive integer m is uniquely specified by its remainder module k relatively prime integers p 1, ···, pk, provided m<Πi=1kpi. Thus the residues of m module relatively prime integers p1