Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits

DOI10.1007/978-3-030-40186-3_15zbMath1454.94147OpenAlexW2977268204MaRDI QIDQ785027

Renaud Sirdey, Sergiu Carpov, Pascal Aubry

Publication date: 5 August 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-40186-3_15

zbMATH Keywords

Boolean functionsheuristicmultiplicative depthsomewhat homomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Related Items (2)

Parameter optimization and larger precision for (T)FHE ⋮ SPEED: secure, private, and efficient deep learning

This page was built for publication: Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits