Algorithms for the approximate common divisor problem

DOI10.1112/S1461157016000218zbMath1404.11142WikidataQ61914002 ScholiaQ61914002MaRDI QIDQ2970999

Steven D. Galbraith, Sean Murphy, Shishay W. Gebregiyorgis

Publication date: 4 April 2017

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (10)

Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ Fast practical lattice reduction through iterated compression ⋮ Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Algorithms for CRT-variant of approximate greatest common divisor problem ⋮ Homomorphic encryption systems statement: trends and challenges ⋮ Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ Simultaneous diagonalization of incomplete matrices and applications ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems

Cites Work

• Factoring polynomials with rational coefficients
• Security Analysis of Multilinear Maps over the Integers
• Fully Homomorphic Encryption over the Integers
• Batch Fully Homomorphic Encryption over the Integers
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Noise-tolerant learning, the parity problem, and the statistical query model

This page was built for publication: Algorithms for the approximate common divisor problem