EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Multivariate Polynomial Inference in a Cryptographic Setting

Ramona Corbeanu, Diana Maimuţ, George Teşeleanu

Mathematics · 29.05.2026 · 14 (11) · 1903

DOI: 10.3390/math14111903 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 29.05.2026. Verfasst von Ramona Corbeanu und 2 weiteren Autor:innen. Die Arbeit nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we generalize to the multivariate setting the current state-of-the-art methods in the literature for the inference of bivariate polynomials constructed recursively, by means of repeated additions and multiplications. We present two main approaches: the first one based on polynomial interpolation and the second one relying on lattice-based techniques for solving modular knapsack-type problems. Both the directions yield natural and practical generalizations, supported by detailed analyses of the underlying mathematical structures. Our methods can be useful for analyzing the security of cryptographic algorithms, given their connection to basic operations serving as building blocks, for example in fully homomorphic encryption schemes.

Zitieren

APA

Corbeanu, R., Maimuţ, D., & Teşeleanu, G. (2026). Multivariate Polynomial Inference in a Cryptographic Setting. Mathematics, 14(11), 1903. https://doi.org/10.3390/math14111903

Vancouver

Corbeanu R, Maimuţ D, Teşeleanu G. Multivariate Polynomial Inference in a Cryptographic Setting. Mathematics. 2026;14(11):1903. doi:10.3390/math14111903

BibTeX
@article{Corbeanu2026,
  author = {Corbeanu, Ramona and Maimuţ, Diana and Teşeleanu, George},
  title = {Multivariate Polynomial Inference in a Cryptographic Setting},
  journal = {Mathematics},
  year = {2026},
  volume = {14},
  number = {11},
  pages = {1903},
  doi = {10.3390/math14111903}
}
Kostenlos starten →