Revisiting orthogonal lattice attacks on approximate common divisor problems
From MaRDI portal
Publication:2118873
DOI10.1016/J.TCS.2022.02.005OpenAlexW4213307161MaRDI QIDQ2118873FDOQ2118873
Jun Xu, Lei Hu, Santanu Sarkar
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.005
Cites Work
- BKZ 2.0: Better Lattice Security Estimates
- Fully Homomorphic Encryption over the Integers
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
- Approximate common divisors via lattices
- Predicting Lattice Reduction
- Practical Multilinear Maps over the Integers
- The LLL algorithm. Survey and applications
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- An LLL-reduction algorithm with quasi-linear time complexity
- Title not available (Why is that?)
- Batch Fully Homomorphic Encryption over the Integers
- New Multilinear Maps Over the Integers
- Title not available (Why is that?)
- Title not available (Why is that?)
- New directions in nearest neighbor searching with applications to lattice sieving
- Title not available (Why is that?)
- On the concrete hardness of learning with errors
- Fully Homomophic Encryption over the Integers Revisited
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Revisiting the expected cost of solving uSVP and applications to LWE
- Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- Algorithms for the approximate common divisor problem
- Implicit Factoring with Shared Most Significant and Middle Bits
- Approximate Integer Common Divisor Problem Relates to Implicit Factorization
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- LLL reducing with the most significant bits
- Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors
- Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
Cited In (1)
Uses Software
This page was built for publication: Revisiting orthogonal lattice attacks on approximate common divisor problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118873)
