Noisy polynomial interpolation and noisy Chinese remaindering
From MaRDI portal
Publication:3374898
Recommendations
- Noisy polynomial interpolation modulo prime powers
- Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields
- Noisy interpolation of sparse polynomials in finite fields
- Study and improvement of the multiplicative noisy polynomial interpolation algorithm on integral ring
- Sparse polynomial approximation in finite fields
Cited in
(20)- Fast LLL-type lattice reduction
- Using LLL-reduction for solving RSA and factorization problems
- The MMO problem
- A fuzzy vault scheme
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- Noisy interpolation of sparse polynomials in finite fields
- Study and improvement of the multiplicative noisy polynomial interpolation algorithm on integral ring
- Correcting noisy exponentiation black-boxes modulo a prime
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- Noisy polynomial interpolation modulo prime powers
- Augmented oblivious polynomial evaluation protocol and its applications
- Noisy Chinese remaindering in the Lee norm
- Oblivious polynomial evaluation and oblivious neural learning
- Finding smooth integers in short intervals using CRT decoding
- Oblivious keyword search
- MyOPE: malicious security for oblivious polynomial evaluation
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited
- An analytic solution to the modified mild-slope equation for wave propagation over one-dimensional piecewise smooth topographies
- A Highly Scalable RFID Authentication Protocol
This page was built for publication: Noisy polynomial interpolation and noisy Chinese remaindering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374898)
