Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Quasi-gcd computations
Factoring polynomials with rational coefficients
Approximate GCD and its application to ill-conditioned algebraic equations
On approximate GCDs of univariate polynomials
Detection and validation of clusters of polynomial zeros
Small solutions to polynomial equations, and low exponent RSA vulnerabilities
On lattice reduction for polynomial matrices
The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
Computing approximate greatest common right divisors of differential polynomials
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
Oblivious transfer and polynomial evaluation
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
Fully Homomophic Encryption over the Integers Revisited
Approximate common divisors via lattices
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
Fully Homomorphic Encryption over the Integers
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
Improved decoding of Reed-Solomon and algebraic-geometry codes
Batch Fully Homomorphic Encryption over the Integers
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
<tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
Scale-Invariant Fully Homomorphic Encryption over the Integers
On lattices, learning with errors, random linear codes, and cryptography