IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i24p4989-d1302192.html
   My bibliography  Save this article

AIOL: An Improved Orthogonal Lattice Algorithm for the General Approximate Common Divisor Problem

Author

Listed:
  • Yinxia Ran

    (School of Computer and Cyberspace Secrity, Communication University of China (CUC), 1 Dingfuzhuang East Street, Beijing 100024, China
    Research Center for Basic Theories of Intelligent Computing, Research Institute of Basic Theories, Zhejiang Lab, Hangzhou 311121, China
    School of Mathematics and Information Technology, Longnan Teachers College (LNTC), 34 Longnan Road, Longnan 742500, China)

  • Yun Pan

    (School of Computer and Cyberspace Secrity, Communication University of China (CUC), 1 Dingfuzhuang East Street, Beijing 100024, China)

  • Licheng Wang

    (School of Cyberspace Science and Technology, Beijing Insititute of Technology (BIT), 5 Zhongguancun South Street, Beijing 100081, China)

  • Zhenfu Cao

    (Research Center for Basic Theories of Intelligent Computing, Research Institute of Basic Theories, Zhejiang Lab, Hangzhou 311121, China
    Shanghai Key Laboratory of Trustworthy Computing, East China Normal University (ECNU), 3663 North Zhongshan Road, Shanghai 200062, China)

Abstract

The security of several fully homomorphic encryption (FHE) schemes depends on the intractability assumption of the approximate common divisor (ACD) problem over integers. Subsequent efforts to solve the ACD problem as well as its variants were also developed during the past decade. In this paper, an improved orthogonal lattice (OL)-based algorithm, AIOL, is proposed to solve the general approximate common divisor (GACD) problem. The conditions for ensuring the feasibility of AIOL are also presented. Compared to the Ding–Tao OL algorithm, the well-known LLL reduction method is used only once in AIOL, and when the error vector r is recovered in AIOL, the possible difference between the restored and the true value of p is given. Experimental comparisons between the Ding-Tao algorithm and ours are also provided to validate our improvements.

Suggested Citation

  • Yinxia Ran & Yun Pan & Licheng Wang & Zhenfu Cao, 2023. "AIOL: An Improved Orthogonal Lattice Algorithm for the General Approximate Common Divisor Problem," Mathematics, MDPI, vol. 11(24), pages 1-12, December.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:24:p:4989-:d:1302192
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/24/4989/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/24/4989/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:24:p:4989-:d:1302192. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.