Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Rodier, François"'
Publikováno v:
Cryptography and Communications--Discrete Structures, Boolean Functions, and Sequences, 2024, Volume 16 (2)
The autocorrelation of a sequence is a useful criterion, among all, of resistance to cryptographic attacks. The behavior of the autocorrelations of random Boolean functions (studied by Florian Caullery, Eric F\'erard and Fran\c{c}ois Rodier [4]) show
Externí odkaz:
http://arxiv.org/abs/2410.11347
We give an overview of several of the mathematical works of Gilles Lachaud and provide a historical context. This is interspersed with some personal anecdotes highlighting many facets of his personality.
Comment: 21 pages
Comment: 21 pages
Externí odkaz:
http://arxiv.org/abs/2004.03263
Autor:
Rodier, François
The search for Boolean functions that can withstand the main crypyographic attacks is essential. In 2008, Carlet and Feng studied a class of functions which have optimal cryptographic properties with the exception of nonlinearity for which they give
Externí odkaz:
http://arxiv.org/abs/2003.12491
Autor:
Caullery, Florian, Rodier, François
The absolute indicator is one of the measures used to determine the resistance offered by a Boolean function when used in the design of a symmetric cryptosystem. It was proposed along with the sum of square indicator to evaluate the quality of the di
Externí odkaz:
http://arxiv.org/abs/1801.03337
Autor:
Rodier, François
Publikováno v:
Cryptography and Communications, 2011, pp.227-240
We prove a necessary condition for some polynomials of degree 4e (e an odd number) to be APN over F q n for large n, and we investigate the polynomials f of degree 12.
Comment: arXiv admin note: text overlap with arXiv:1212.4638 by other authors
Comment: arXiv admin note: text overlap with arXiv:1212.4638 by other authors
Externí odkaz:
http://arxiv.org/abs/1602.00837
Autor:
Dib, Stéphanie, Rodier, François
We present an asymptotic limit between correctable and uncor-rectable errors on the Reed-Muller codes of any order. This limit is theoretical and does not depend of any decoding algorithm.
Externí odkaz:
http://arxiv.org/abs/1411.3545
Autor:
Rodier, François
We prove a necessary condition for some polynomials of Kasami degree to be APN over F_{q^n} for large n.
Comment: 10
Comment: 10
Externí odkaz:
http://arxiv.org/abs/1101.6033
We consider exceptional APN functions on ${\bf F}_{2^m}$, which by definition are functions that are not APN on infinitely many extensions of ${\bf F}_{2^m}$. Our main result is that polynomial functions of odd degree are not exceptional, provided th
Externí odkaz:
http://arxiv.org/abs/0909.2304
Autor:
Aubry, Yves, Rodier, François
We give a geometric characterization of vectorial boolean functions with differential uniformity less or equal to 4.
Externí odkaz:
http://arxiv.org/abs/0907.1734
Autor:
Leander, Gregor, Rodier, François
We prove that functions $f:\f{2^m} \to \f{2^m}$ of the form $f(x)=x^{-1}+g(x)$ where $g$ is any non-affine polynomial are APN on at most a finite number of fields $\f{2^m}$. Furthermore we prove that when the degree of $g$ is less then 7 such functio
Externí odkaz:
http://arxiv.org/abs/0901.4322