Algorithms for CRT-variant of approximate greatest common divisor problem
From MaRDI portal
Publication:2025331
Recommendations
- Algorithms for the approximate common divisor problem
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Approximate common divisor problem and continued fractions
- Approximate common divisors via lattices
- Approximate common divisor problem and lattice sieving
Cites work
- scientific article; zbMATH DE number 1852136 (Why is no real title available?)
- Algorithms for the approximate common divisor problem
- Batch fully homomorphic encryption over the integers
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Cryptanalysis of the multilinear map over the integers
- Factoring polynomials with rational coefficients
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Fully homomophic encryption over the integers revisited
- Fully homomorphic encryption over the integers
- On Lovász' lattice reduction and the nearest lattice point problem
- Practical multilinear maps over the integers
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Random matrices: law of the determinant
Cited in
(4)
This page was built for publication: Algorithms for CRT-variant of approximate greatest common divisor problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025331)
