Summary

In this chapter, we introduced the basic principles of homomorphic encryption and its fundamental bases, and we analyzed the partial homomorphism in RSA.

After that, we explored the math behind search engines and, in particular, Eulerian circuits. We then undertook a deep dive into trees (graph theory), experimenting with a particular tree graph construction such as Huffman code. If usefully combined with hash trees and other elements, this algorithm is an excellent candidate for searching and compressing data in unstructured content.

Finally, we analyzed CSE, looking at its principal elements and possible future applications.

You have now learned what CSE is and how it is implemented.

Now that you have learned the CSE fundamentals and have explored most of the main cryptographic algorithms, I wish to congratulate you. I hope that this book will be helpful in your career and your professional life.