Mathematics

An introduction to Fully Homomorphic Encryption (FHE), a cryptographic technique that allows computations to be performed on encrypted data without needing to decrypt it first.

This blog outlines the basics of propositional logic, as explained by the book “Logic in compuer science”.

This paper examines the field of program verification, emphasizing the precise implementation of algorithms through computational models like finite automata and Turing machines.