Thesis Type: Postgraduate
Institution Of The Thesis: Orta Doğu Teknik Üniversitesi, Institute of Applied Mathematics, Cryptography, Turkey
Approval Date: 2017
Student: İREM KESKİNKURT
Supervisor: MURAT CENKAbstract:
The encryption techniques used to ensure data secrecy have been evolving in compliance with the developments in technology and reforming according to need. Nowadays, the increase in the amount of data that should be stored in encrypted form, has led to the need for encryption schemes that provide both the safety and the efficient usability of data. Homomorphic encryption, which enables the ability to make computations on encrypted data, is seen as one of the solutions that can meet this need. In this thesis, the definitions and the properties of homomorphic encryption, some possible practical applications of homomorphic encryption, the Ring Learning with Errors problem and a somewhat homomorphic encryption scheme based on this problem has been examined. The computational complexity and efficiency of the algorithm have been studied by adapting some techniques in the literature to the algorithm.