Speaker
Description
As a solution to the needs of many applications that operate on sensitive data, homomorphic algorithms – algorithms that allow calculations with encrypted information – were developed. They present a viable alternative to traditional cryptosystems which typically require such applications to decrypt and re-encrypt the information numerous times. Driven by the interesting nature and expanding use cases of these algorithms, this project intends to research and compare two well-known partially homomorphic algorithms (ones that can only support a few binary operations) – namely, the Paillier and exponential ElGamal schemes. After detailing their implementation and providing a brief mathematical explanation of their properties and how they arise, the algorithms will be comparatively analyzed through a series of benchmarks that aim to test their general effectiveness, efficiency, and accuracy. At the end, a preview of the application designed for this purpose will be provided and a summary of the results will be presented and compiled into various informative charts.
Keywords: Cryptography, homomorphic algorithms, Paillier encryption, ElGamal encryption, software development
| Title | Homomorphic Encryption Algorithms: A Comparative Study for Data Security and Integrity |
|---|
