Revisiting Orthogonal Lattice Attacks on Approximate Common Divisor Problems and their Applications

No abstract is available for this paper.

• Publication year

  2018

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime

  2017cited by this paper
• Revisiting the Expected Cost of Solving uSVP and Applications to LWE

  2017cited by this paper
• On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL

  2017cited by this paper
• New directions in nearest neighbor searching with applications to lattice sieving

  2016cited by this paper
• Algorithms for the Approximate Common Divisor Problem

  2016influential reference
• FHE Over the Integers and Modular Arithmetic Circuits

  2016influential reference
• Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator

  2016cited by this paper
• Fully Homomorphic Encryption over the Integers Revisited

  2016influential reference
• New Multilinear Maps Over the Integers

  2015cited by this paper
• (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces

  2015influential reference
• On the concrete hardness of Learning with Errors

  2015cited by this paper
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing

  2015cited by this paper
• A New Algorithm for Solving the General Approximate Common Divisors Problem and Cryptanalysis of the FHE Based on the GACD problem

  2014cited by this paper
• Scale-Invariant Fully Homomorphic Encryption over the Integers

  2014cited by this paper
• Faster Bootstrapping with Polynomial Error

  2014cited by this paper
• Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences

  2014cited by this paper
• Lattice-based FHE as secure as PKE

  2014cited by this paper
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

  2013cited by this paper
• Practical Multilinear Maps over the Integers

  2013cited by this paper
• Packed Ciphertexts in LWE-Based Homomorphic Encryption

  2013cited by this paper
• Batch Fully Homomorphic Encryption over the Integers

  2013cited by this paper
• Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors

  2013cited by this paper
• Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers

  2012cited by this paper
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

  2012cited by this paper
• Homomorphic Evaluation of the AES Circuit

  2012cited by this paper
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers

  2012influential reference
• Fully Homomorphic Encryption with Polylog Overhead

  2012cited by this paper
• An LLL-reduction algorithm with quasi-linear time complexity: extended abstract

  2011cited by this paper
• Efficient Fully Homomorphic Encryption from (Standard) LWE

  2011cited by this paper
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys

  2011influential reference
• Implementing Gentry's Fully-Homomorphic Encryption Scheme

  2011cited by this paper
• Approximate common divisors via lattices

  2011cited by this paper
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

  2011cited by this paper
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization

  2011influential reference
• BKZ 2.0: Better Lattice Security Estimates

  2011cited by this paper
• Analyzing Blockwise Lattice Algorithms Using Dynamical Systems

  2011cited by this paper
• Fully Homomorphic Encryption over the Integers

  2010influential reference
• Faster Fully Homomorphic Encryption

  2010cited by this paper
• Implicit Factoring with Shared Most Significant and Middle Bits

  2010influential reference
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

  2010cited by this paper
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding

  2010cited by this paper
• The LLL Algorithm - Survey and Applications

  2009cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009influential reference
• Predicting Lattice Reduction

  2008influential reference
• On lattices, learning with errors, random linear codes, and cryptography

  2005influential reference
• Lattice Reduction by Random Sampling and Birthday Methods

  2003influential reference
• Approximate Integer Common Divisors

  2001cited by this paper
• Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations

  1997cited by this paper
• Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction

  1995cited by this paper
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems

  1991cited by this paper
• Factoring polynomials with rational coefficients

  1982cited by this paper
• The computational complexity of simultaneous Diophantine approximation problems

  1982cited by this paper

• AIOL: An Improved Orthogonal Lattice Algorithm for the General Approximate Common Divisor Problem

  2023cites this paper
• Efficient GSW-Style Fully Homomorphic Encryption over the Integers

  2021influential citation
• Frontiers in Cyber Security: Second International Conference, FCS 2019, Xi'an, China, November 15–17, 2019, Proceedings

  2019cites this paper
• Implementing Attacks on the Approximate Greatest Common Divisor Problem

  2019cites this paper