scholarly journals On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion

2016 ◽  
Vol 27 (5) ◽  
pp. 359-372 ◽  
Author(s):  
Riccardo Aragona ◽  
Marco Calderini ◽  
Daniele Maccauro ◽  
Massimiliano Sala
Author(s):  
M. Boumezbeur ◽  
S. Mesnager ◽  
K. Guenda

In this paper, we study the relationship between vectorial (Boolean) functions and cyclic codes in the context of algebraic attacks. We first derive a direct link between the annihilators of a vectorial function (in univariate form) and certain [Formula: see text]-ary cyclic codes (which we show that they are LCD codes). We also present some properties of those cyclic codes as well as their weight enumerator. In addition, we generalize the so-called algebraic complement and study its properties.


2015 ◽  
Vol 8 (4) ◽  
pp. 555-577 ◽  
Author(s):  
Brandon Dravie ◽  
Jérémy Parriaux ◽  
Philippe Guillot ◽  
Gilles Millérioux

2019 ◽  
pp. 78-87
Author(s):  
N. M. Kiseleva ◽  
◽  
E. S. Lipatova ◽  
I. A. Pankratova ◽  
E. E. Trifonova ◽  
...  

2016 ◽  
Vol 28 (1) ◽  
pp. 1-13 ◽  
Author(s):  
HONGWEI LI ◽  
LI YANG

A quantum algorithm to determine approximations of linear structures of Boolean functions is presented and analysed. Similar results have already been published (see Simon's algorithm) but only for some promise versions of the problem, and it has been shown that no exponential quantum speedup can be obtained for the general (no promise) version of the problem. In this paper, no additional promise assumptions are made. The approach presented is based on the method used in the Bernstein–Vazirani algorithm to identify linear Boolean functions and on ideas from Simon's period finding algorithm. A proper combination of these two approaches results here to a polynomial-time approximation to the linear structures set. Specifically, we show how the accuracy of the approximation with high probability changes according to the running time of the algorithm. Moreover, we show that the time required for the linear structure determine problem with high success probability is related to so called relative differential uniformity δf of a Boolean function f. Smaller differential uniformity is, shorter time is needed.


2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Claude Carlet

<p style='text-indent:20px;'>We push a little further the study of two recent characterizations of almost perfect nonlinear (APN) functions. We state open problems about them, and we revisit in their perspective a well-known result from Dobbertin on APN exponents. This leads us to a new result about APN power functions and more general APN polynomials with coefficients in a subfield <inline-formula><tex-math id="M1">\begin{document}$ \mathbb{F}_{2^k} $\end{document}</tex-math></inline-formula>, which eases the research of such functions. It also allows to construct automatically many differentially uniform functions from them (this avoids calculations for proving their differential uniformity as done in a recent paper, which are tedious and specific to each APN function). In a second part, we give simple proofs of two important results on Boolean functions, one of which deserves to be better known but needed clarification, while the other needed correction.</p>


Sign in / Sign up

Export Citation Format

Share Document