Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Implementing Attacks on the Approximate Greatest Common Divisor Problem

    The security of many fully homomorphic encryption (FHE) schemes is guaranteed by the difficulty of the approximate greatest common divisor (AGCD) problem. Therefore, the study of AGCD problem is of great sign...

    Leizhang Wang, Quanbo Qu, Tuoyan Li, Yange Chen in Frontiers in Cyber Security (2019)