Abstract

Based on the homomorphism of Lee et al, Xiang Guangli et al proposed similar module and implemented encrypting operations of addition, subtraction, multiplication and division over real number domain. There was additive and multiplicative homomorphism heretofore. But their cipher text leaks the information of decimal fraction, sign and relationship of big and small. We propose additive, subtractive, multiplicative and divisive homomorphism over real number domain based on representation of real number by positive integer and Fermat's Little Theorem. We prove the security and correctness of the proposed homomorphism encryption system. The results of instances show that there are no the problems mentioned above in our algorithm.

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 call

Disclaimer: 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.