Polynomial fully homomorphic encryption system based on coefficient mapping transform

摘要

A polynomial complete homomorphic encryption method based on the coefficient mapping transformation. A plaintext is expressed as a polynomial consisting of a set of random values, two sets of random coefficient factors and a random constant of a specified mapping function, and in the polynomial: the expression and a set of random coefficient factors of the specified mapping function are taken as a key; another set of random coefficient factors, a set of random arguments and random constants of the mapping function are taken as the ciphertexts for homomorphic operations, so that the part of function key performs three different mappings and then undergoes numerical fitting to obtain the family of operational support functions consisting of three sub-functions respectively, which are used to perform the homomorphic operation of the ciphertext based on the family of operational support functions and return to the locality for decryption by the key.