Cryptanalysis of the Co-ACD Assumption

DOI10.1007/978-3-662-47989-6_27zbMath1375.94124OpenAlexW2260177594MaRDI QIDQ3457128

Tancrède Lepoint, Moon Sung Lee, Pierre-Alain Fouque, Mehdi Tibouchi

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_27

zbMATH Keywords

cryptanalysishomomorphic encryptionlattice reductionco-ACD problemcoppersmith theorem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Homomorphic encryption systems statement: trends and challenges ⋮ A polynomial-time algorithm for solving the hidden subset sum problem

Cites Work

• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Lattice-Based Fault Attacks on Signatures
• Practical Multilinear Maps over the Integers
• Estimating Key Sizes for High Dimensional Lattice-Based Systems
• 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
• BKZ 2.0: Better Lattice Security Estimates
• Fully Homomorphic Encryption over the Integers
• Lattice-based Cryptography
• Efficient Cryptosystems from 2 k -th Power Residue Symbols
• Batch Fully Homomorphic Encryption over the Integers
• Fault Attacks Against emv Signatures
• Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
• Scale-Invariant Fully Homomorphic Encryption over the Integers

This page was built for publication: Cryptanalysis of the Co-ACD Assumption