2 papers
cs.SC2021
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices
Clément Pernet, Hippolyte Signargout, Pierre Karpman +1
New algorithms are presented for computing annihilating polynomials of Toeplitz, Hankel, and more generally Toeplitz+ Hankel-like matrices over a field. Our approach follows works…
cs.CR2018
New Instantiations of the CRYPTO 2017 Masking Schemes
Pierre Karpman, Daniel S. Roche
At CRYPTO 2017, Belaïd et al presented two new private multiplication algorithms over finite fields, to be used in secure masking schemes. To date, these algorithms have the lowest…