Relaxed NewtonSLRA for Approximate GCD

2021 ◽  
pp. 272-292
Author(s):  
Kosaku Nagasaka
Keyword(s):  
Approximate Gcd

scholarly journals Approximate GCD of several univariate polynomials with small degree perturbations

2012 ◽  
Vol 47 (4) ◽  
pp. 410-421 ◽  
Author(s):  
Mohamed Elkadi ◽  
André Galligo ◽  
Thang Luu Ba
Keyword(s):  
Small Degree ◽  
Approximate Gcd ◽  
Univariate Polynomials

An Improvement for Fully Homomorphic Encryption over Integers with Shorter Public Keys

2014 ◽  
Vol 989-994 ◽  
pp. 4326-4331
Author(s):  
Ze Tao Jiang ◽  
Xiao Te Huang
Keyword(s):  
Quadratic Form ◽  
Homomorphic Encryption ◽  
Public Key ◽  
Encryption Scheme ◽  
Fully Homomorphic Encryption ◽  
The Public ◽  
Cubic Form ◽  
Public Keys ◽  
Subset Sum ◽  
Approximate Gcd

This paper puts forward a more efficient fully homomorphic encryption scheme with a view to improving the oversized public key based on the Dijk’s scheme.Encrypted with a cubic form in the public key elements instead of quadratic form by adopting Gentry’s fully homomorphic techonology.The results show that the public key size reduce from to compared to the Coron’s scheme.The security of the proposed scheme is based on both the approximate GCD problem and the sparse-subset sum problem.

scholarly journals Approximate GCD and its application to ill-conditioned equations

1991 ◽  
Vol 38 (1-3) ◽  
pp. 335-351 ◽  
Author(s):  
Matu-Tarow Noda ◽  
Tateaki Sasaki
Keyword(s):  
Approximate Gcd

scholarly journals The ERES method for computing the approximate GCD of several polynomials

2010 ◽  
Vol 60 (1-2) ◽  
pp. 94-114 ◽  
Author(s):  
D. Christou ◽  
N. Karcanias ◽  
M. Mitrouli
Keyword(s):  
Approximate Gcd
Sign in / Sign up

Export Citation Format

Share Document