Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

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

Version 1 : Received: 11 October 2023 / Approved: 11 October 2023 / Online: 11 October 2023 (08:50:01 CEST)

A peer-reviewed article of this Preprint also exists.

Ran, Y.; Pan, Y.; Wang, L.; Cao, Z. AIOL: An Improved Orthogonal Lattice Algorithm for the General Approximate Common Divisor Problem. Mathematics 2023, 11, 4989. Ran, Y.; Pan, Y.; Wang, L.; Cao, Z. AIOL: An Improved Orthogonal Lattice Algorithm for the General Approximate Common Divisor Problem. Mathematics 2023, 11, 4989.

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 on solving 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’s OL algorithm, the well-know LLL reduction 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. The experimental comparisons towards the Ding-Tao’s algorithm and ours are also provided for validating our improvements.

Keywords

General Approximate Common Divisors; Fully Homomorphic Encryption; Lattice Attack; Orthogonal Lattice

Subject

Computer Science and Mathematics, Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.