Research On Efficient Full Homomorphic Encryption Algorithm

With the continuous development of the Internet,we have entered an efficient new world.At the same time security issues become more prominent.Especially with the growing needs of data retrieval and operation,security issues become particularly important.The full homomorphic encryption algorithm attracts many researchers'attention because of its unique properties.This algorithm can deal with the ciphertext directly without the decryption process,and the result is the same as that of plaintext.But this algorithm is not practical at present.So how to improve the practicability of the algorithm has become the focus of cryptography experts.The main content of this paper is the research and application of full homomorphic encryption algorithm,which is dedicated to solve the problem of the poor practicability of full homomorphic encryption algorithm.Firstly,we proposed a full homomorphic encryption algorithm without keyswitching on the basis of the Brakerski-Gentry-Vaikuntanathan(BGV)full homomorphic encryption algorithm.This algorithm solves the problem of the large size of public key and the low efficiency of homomorphic operation caused by keyswitching.In addition to the theoretical analysis of the algorithm,the function and performance of the new algorithm are verified by experiments,which proves the superiority of the algorithm in this paper compared to the BGV algorithm and the similar Gentry-Sahai-Waters(GSW13)algorithm.Secondly,we applies the proposed full homomorphic encryption algorithm to implement a ciphertext retrieval algorithm based on full homomorphic encryption.This algorithm makes full use of homomorphic features of full homomorphic encryption to implement ciphertext retrieval,and supports homomorphic operation of retrieval results.Finally,in order to analyze the function and performance of ciphertext retrieval algorithm,we construct an encrypted database system based on MySQL.We use TPC-C benchmark test to complete the experimental comparative analysis,the experimental results show that our algorithm can ensure the security and show good performance at the same time.The research and application of efficient full homomorphic encryption algorithm in this paper improves the practicability of the full homomorphic encryption algorithm further.Based on this algorithm,a more efficient ciphertext retrieval algorithm is proposed,which provides a better solution for the security problem in the the whole life cycle of the data.