Inferring Bivariate Polynomials for Homomorphic Encryption Application

ePrint Report: Inferring Bivariate Polynomials for Homomorphic Encryption Application

Diana Maimut, George Teseleanu

Inspired by the advancements in (fully) homomorphic encryption during the last decades and its practical applications, we conduct a preliminary study on the underlying mathematical structure of the corresponding schemes. Hence, this paper focuses on investigating the challenge of deducing bivariate polynomials constructed using homomorphic operations, namely repetitive additions and multiplications.


To begin with, we introduce an approach for solving the previously mentioned problem using Lagrange interpolation …

application applications challenge diana encryption eprint report homomorphic encryption report study