108 citations · 310 across the 26 of their papers we have counts for
4 papers · 1 filter
What Can (and Can't) we Do with Sparse Polynomials?
Daniel S. Roche
Simply put, a sparse polynomial is one whose zero coefficients are not explicitly stored. Such objects are ubiquitous in exact computing, and so naturally we would like to have eff…
Verification Protocols with Sub-Linear Communication for Polynomial Matrix Operations
David Lucas, Vincent Neiger, Clément Pernet +2
We design and analyze new protocols to verify the correctness of various computations on matrices over the ring F[x] of univariate polynomials over a field F. For the sake of effic…
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…
Error correction in fast matrix multiplication and inverse
Daniel S. Roche
We present new algorithms to detect and correct errors in the product of two matrices, or the inverse of a matrix, over an arbitrary field. Our algorithms do not require any additi…