New Instantiations of the CRYPTO 2017 Masking Schemes

05/22/2018
by   Pierre Karpman, et al.
0

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 known complexity in terms of bilinear multiplication and random masks respectively, both being linear in the number of shares d+1. Yet, a practical drawback of both algorithms is that their safe instantiation relies on finding matrices satisfying certain conditions. In their work, Belaïd et al only address these up to d=2 and 3 for the first and second algorithm respectively, limiting so far the practical usefulness of their schemes. In this paper, we use in turn an algebraic, heuristic, and experimental approach to find many more safe instances of Belaïd et al's algorithms. This results in explicit such instantiations up to order d = 6 over large fields, and up to d = 4 over practically relevant fields such as F_2^8.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2019

Cryptanalysis of two schemes of Baba et al. by linear algebra methods

We show that the attacks based on the linear decomposition method introd...
research
12/19/2018

Efficient Representation and Counting of Antipower Factors in Words

A k-antipower (for k > 2) is a concatenation of k pairwise distinct word...
research
06/30/2017

P-schemes and Deterministic Polynomial Factoring over Finite Fields

We introduce a family of mathematical objects called P-schemes, where P ...
research
02/06/2023

Spatial Functa: Scaling Functa to ImageNet Classification and Generation

Neural fields, also known as implicit neural representations, have emerg...
research
08/02/2022

Improvement of algebraic attacks for solving superdetermined MinRank instances

The MinRank (MR) problem is a computational problem that arises in many ...
research
04/04/2023

Determinantal Sieving

We introduce determinantal sieving, a new, remarkably powerful tool in t...
research
03/15/2021

Of Toasts and Tails

We present an intimate connection among the following fields: (a) dist...

Please sign up or login with your details

Forgot password? Click here to reset