AIOL: An Improved Orthogonal Lattice Algorithm for the General Approximate Common Divisor Problem
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...
Main Authors: | Yinxia Ran, Yun Pan, Licheng Wang, Zhenfu Cao |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-12-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/24/4989 |
Similar Items
-
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem
by: Cheon Jung Hee, et al.
Published: (2020-10-01) -
A note on the zero divisor graph of a lattice
by: T. Tamizh Chelvam, et al.
Published: (2014-09-01) -
Novel identity-based fully homomorphic encryption scheme from lattice
by: Yong-li TANG, et al.
Published: (2017-05-01) -
Novel identity-based fully homomorphic encryption scheme from lattice
by: Yong-li TANG, et al.
Published: (2017-05-01) -
Efficient identity-based fully homomorphic encryption over NTRU
by: Ran DUAN, et al.
Published: (2017-01-01)