Learn how to design a logic circuit that performs a specific boolean function using boolean algebra, logic gates, and circuit diagrams.

This project studies methods for optimizing boolean circuits in the context of fully homomorphic encryption (FHE). With respect to encrypted computation and securing machine learning, the complexity ...

Algebraic Normal Form (ANF) for taking an element GF2^8=GF256 Modulo a Fixed Irreducible Polynomial over GF(2^4)=GF16 The ANF of d-ary (# input bits) Boolean function is a sequence of 2^d bits. The ...

Recent advances in Vector Oblivious Linear Evaluation (VOLE) protocols have enabled constant-round, fast, and scalable (designated-verifier) zero-knowledge proofs, significantly reducing prover ...

Multiplierless constant multiplication using bit-shifts, additions and subtractions has been an active research topic in the last decades. The multiplication with multiple constants, known as the ...