The following pages link to Chinese remaindering with errors (Q4501745):
Displaying 18 items.
- A wireless secret key generation method based on Chinese remainder theorem in FDD systems (Q439844) (← links)
- Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes (Q497226) (← links)
- Lattice-based treshold-changeability for standard CRT secret-sharing schemes (Q998654) (← links)
- Distributive weighted threshold secret sharing schemes (Q1671693) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- Algorithm for constructing modular projections for correcting multiple errors based on a redundant residue number system using maximum likelihood decoding (Q2064397) (← links)
- A collaborative secret sharing scheme based on the Chinese remainder theorem (Q2160650) (← links)
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme (Q2198255) (← links)
- Secret sharing schemes for infinite sets of participants: a new design technique (Q2227498) (← links)
- List decoding of number field codes (Q2249795) (← links)
- Optimal estimates of common remainder for the robust Chinese remainder theorem (Q2299835) (← links)
- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme (Q2446574) (← links)
- Generalized Mignotte's Sequences Over Polynomial Rings (Q2866726) (← links)
- General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting (Q2866729) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- (Q5384162) (← links)
- List decoding of maximal order codes over number fields (Q6185629) (← links)
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data (Q6554885) (← links)
