Abstract
Fully homomorphic encryption (FHE) has been regarded as the holy grail of cryptography and supports meaningful computations on encrypted data. Recently, Kumer et al. proposed a symmetric FHE scheme based on the Euler theorem. However, we illustrate in the paper that the secret key can be recovered from the homomorphic computation key and only a pair of known plaintext/ciphertext by computing the greatest common divisor with the Euclidean algorithm. Our observations are well supported by the numerical experiments on the suggested parameters. Furthermore, an improvement in the scheme is presented. We mimic Dijk et al.'s idea to illustrate that the improvement can be reduced to the approximate greatest common divisor (AGCD) problem. Several known attacks, including the proposal in this paper, are also examined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
