Chinese remaindering with errors
DOI10.1109/18.850672zbMATH Open1007.94026OpenAlexW2129270830MaRDI QIDQ4501745FDOQ4501745
Authors: Oded Goldreich, Dana Ron, Madhu Sudan 
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.850672
Recommendations
Chinese remainder theoremlist decodinglattice reductionefficient decoding algorithmredundant residue number system codes
Congruences; primitive roots; residue systems (11A07) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Arithmetic codes (94B40)
Cited In (32)
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
- Error analysis of approximate Chinese-remainder-theorem decoding
- Worst-Case to Average-Case Reductions for Subclasses of P
- Relaxed simultaneous congruences
- Secret sharing schemes for infinite sets of participants: a new design technique
- Chinese remaindering with multiplicative noise
- Chinese remainder codes
- Title not available (Why is that?)
- Lattice-based treshold-changeability for standard CRT secret-sharing schemes
- A wireless secret key generation method based on Chinese remainder theorem in FDD systems
- List decoding of number field codes
- Census algorithms for chinese remainder pseudorank
- Chinese remainder codes
- List decoding of maximal order codes over number fields
- Noisy Chinese remaindering in the Lee norm
- Analytical Review of Methods for Detection, Localization and Error Correction in the Residue Number System
- A collaborative secret sharing scheme based on the Chinese remainder theorem
- Chinese remainder theorem, Reed-Solomon codes, and list decoding
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- Title not available (Why is that?)
- Finding smooth integers in short intervals using CRT decoding
- Distributive weighted threshold secret sharing schemes
- A generalized Chinese remainder theorem for residue sets with errors
- Generalized Mignotte's sequences over polynomial rings
- On the theory of error control based on moduli with common factors
- Algorithm for constructing modular projections for correcting multiple errors based on a redundant residue number system using maximum likelihood decoding
- Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
- Optimal estimates of common remainder for the robust Chinese remainder theorem
- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
- Title not available (Why is that?)
- General secret sharing based on the Chinese remainder theorem with applications in e-voting
- Title not available (Why is that?)
This page was built for publication: Chinese remaindering with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501745)
