Algorithms for CRT-variant of approximate greatest common divisor problem
DOI10.1515/JMC-2019-0031zbMATH Open1466.11097OpenAlexW3095958347MaRDI QIDQ2025331FDOQ2025331
Authors: Jung Hee Cheon, Wonhee Cho, Minki Hhan, Jiseung Kim, C.-M. Lee 
Publication date: 12 May 2021
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2019-0031
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
Cryptography (94A60) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Fully homomorphic encryption over the integers
- Factoring polynomials with rational coefficients
- 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
- Practical multilinear maps over the integers
- On Lovász' lattice reduction and the nearest lattice point problem
- Random matrices: law of the determinant
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Title not available (Why is that?)
- Batch fully homomorphic encryption over the integers
- Cryptanalysis of the Multilinear Map over the Integers
- Fully Homomophic Encryption over the Integers Revisited
- Algorithms for the approximate common divisor problem
Cited In (2)
Uses Software
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)
