22 citations · 26 across the 7 of their papers we have counts for
15 papers
Quantum Key Distribution with Efficient Post-Quantum Cryptography-Secured Trusted Node on a Quantum Network
Yoann Piétri, Pierre-Enguerrand Verdier, Baptiste Lacour +13
Quantum Key Distribution (QKD) enables two distant users to exchange a secret key with information-theoretic security, based on the fundamental laws of quantum physics. While it is…
Polynomial-Division-Based Algorithms for Computing Linear Recurrence Relations
Jérémy Berthomieu, Jean-Charles Faugère
Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear re…
Koszul-type determinantal formulas for families of mixed multilinear systems
Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris +1
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of ma…
Computing critical points for invariant algebraic systems
Jean-Charles Faugère, George Labahn, Mohab Safey El Din +2
Let be a field and , in be multivariate polynomials (with ) invariant under the action of $\m…
Gr{ö}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems
Matías Bender, Jean-Charles Faugère, Elias Tsigaridas
Gr{ö}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential i…
A nearly optimal algorithm to decompose binary forms
Matías Bender, Jean-Charles Faugère, Ludovic Perret +1
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. I…