108 citations · 310 across the 26 of their papers we have counts for
1 paper · 2 filters
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…