Cryptanalysis of the co-ACD assumption
From MaRDI portal
Recommendations
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Algorithms for the approximate common divisor problem
- Fully homomophic encryption over the integers revisited
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
Cites work
- Batch fully homomorphic encryption over the integers
- BKZ 2.0: Better lattice security estimates
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Estimating key sizes for high dimensional lattice-based systems
- Factoring polynomials with rational coefficients
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Fault attacks against EMV signatures
- Fully homomorphic encryption over the integers
- Lattice-based Cryptography
- Lattice-based fault attacks on signatures
- Practical multilinear maps over the integers
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences
- Scale-invariant fully homomorphic encryption over the integers
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
Cited in
(3)
This page was built for publication: Cryptanalysis of the co-ACD assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457128)
