Chinese remaindering with errors

DOI10.1145/301250.301309zbMath1345.94105OpenAlexW2007747613MaRDI QIDQ2819549

Oded Goldreich, Dana Ron, Madhu Sudan

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301309

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Congruences; primitive roots; residue systems (11A07) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Arithmetic codes (94B40)

Related Items (7)

ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls ⋮ Homomorphic extensions of CRT-based secret sharing ⋮ List decoding of maximal order codes over number fields ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ Constructing ideal secret sharing schemes based on Chinese remainder theorem ⋮ Finding smooth integers in short intervals using CRT decoding ⋮ Secret Swarm Unit Reactive k −Secret Sharing

This page was built for publication: Chinese remaindering with errors