Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction

DOI10.1007/978-3-030-35423-7_20MaRDI QIDQ2179403zbMATHOpenAlexFDO

Authors Jun Xu, Santanu Sarkar, Lei Hu

Publication date 12 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-35423-7_20

zbMATH Keywords

approximate polynomial common divisor problemnoisy multipolynomial reconstructionpolynomial lattice

Mathematics Subject Classification ID

Cryptography (94A60) Continued fractions and generalizations (11J70) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Recommendations

• Approximate common divisors via lattices
• Algorithms for the approximate common divisor problem
• Approximate common divisor problem and lattice sieving
• Approximate common divisor problem and continued fractions
• Noisy polynomial interpolation and noisy Chinese remaindering

Cites work

• scientific article; zbMATH DE number 3711820 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 2151192 (Why is no real title available?)
• scientific article; zbMATH DE number 953021 (Why is no real title available?)
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• scientific article; zbMATH DE number 1852142 (Why is no real title available?)
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• Approximate GCD and its application to ill-conditioned algebraic equations
• Approximate common divisors via lattices
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Batch fully homomorphic encryption over the integers
• Computing approximate greatest common right divisors of differential polynomials
• Detection and validation of clusters of polynomial zeros
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• Factoring polynomials with rational coefficients
• Fully homomophic encryption over the integers revisited
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption over the integers with shorter public keys
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
• Noisy polynomial interpolation and noisy Chinese remaindering
• Oblivious transfer and polynomial evaluation
• On approximate GCDs of univariate polynomials
• On lattice reduction for polynomial matrices
• On lattices, learning with errors, random linear codes, and cryptography
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Quasi-gcd computations
• Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
• Scale-invariant fully homomorphic encryption over the integers
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• The polynomial approximate common divisor problem and its application to the fully homomorphic encryption

This page was built for publication: Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179403)