Algorithms for CRT-variant of approximate greatest common divisor problem

DOI10.1515/JMC-2019-0031zbMATH Open1466.11097OpenAlexW3095958347MaRDI QIDQ2025331FDOQ2025331

Jiseung Kim, Jung Hee Cheon, Wonhee Cho, Minki Hhan, 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

zbMATH Keywords

latticeCCK-ACDorthogonal lattice attackSDA

Mathematics Subject Classification ID

Cryptography (94A60) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• 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
• 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)

• New Results of Breaking the CLS Scheme from ACM-CCS 2014
• Title not available (Why is that?)

Uses Software

• fpLLL
• fhe
• GitHub

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)