Algorithms for CRT-variant of approximate greatest common divisor problem
type: Item
instance of: scholarly article
title: Algorithms for CRT-variant of approximate greatest common divisor problem
zbMATH Open document ID: 1466.11097
author: Jung Hee Cheon
author: Wonhee Cho
author: Minki Hhan
author: Jiseung Kim
author: C.-M. Lee
published in: Journal of Mathematical Cryptology
publication date: 2021-05-12T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11A05
zbMATH DE Number: 7347750
zbMATH Keywords: CCK-ACD
zbMATH Keywords: lattice
zbMATH Keywords: orthogonal lattice attack
zbMATH Keywords: SDA
describes a project that uses: fhe
describes a project that uses: fpLLL
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: jmc-2019-0031
OpenAlex ID: W3095958347
cites work: On Lovász' lattice reduction and the nearest lattice point problem
cites work: Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
cites work: Batch Fully Homomorphic Encryption over the Integers
cites work: Cryptanalysis of the Multilinear Map over the Integers
cites work: Fully Homomophic Encryption over the Integers Revisited
cites work: Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
cites work: Practical Multilinear Maps over the Integers
cites work: Algorithms for the approximate common divisor problem
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Q4787198
cites work: Factoring polynomials with rational coefficients
cites work: Random matrices: law of the determinant
cites work: Fully Homomorphic Encryption over the Integers
DOI: 10.1515/JMC-2019-0031
description: scientific article; zbMATH DE number 7347750