Pages that link to "Item:Q2949498"

The following pages link to Approximate common divisors via lattices (Q2949498):

Displaying 18 items.

• Polly cracker, revisited (Q285245) (← links)
• A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
• Improved power decoding of interleaved one-point Hermitian codes (Q1727371) (← links)
• On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
• CRT-based fully homomorphic encryption over the integers (Q1749613) (← links)
• The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
• Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
• Coppersmith's lattices and ``focus groups'': an attack on small-exponent RSA (Q1998906) (← links)
• Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
• Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
• On the greatest common divisor of shifted sets (Q2343172) (← links)
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
• Computing minimal interpolation bases (Q2628323) (← links)
• Towards Optimal Bounds for Implicit Factorization Problem (Q2807227) (← links)
• Finding well approximating lattices for a finite set of points (Q4683170) (← links)
• Privacy-Preserving Support Vector Machines with Flexible Deployment and Error Correction (Q5095933) (← links)
• FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime (Q5738759) (← links)
• Simultaneous diagonalization of incomplete matrices and applications (Q5853794) (← links)