activity
20092024
most citedFunctions of degree 4e that are not APN infinitely often

19 citations · 21 across the 6 of their papers we have counts for

collaborators

7 papers

cs.IT2024

Periodic autocorrelation of sequences

Florian Caullery, Eric F Érard, François Rodier

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 (studie…

cs.IT2018

Distribution of the absolute indicator of random Boolean functions

Florian Caullery, François Rodier

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 al…

math.NT2016★ 19 cited

Functions of degree 4e that are not APN infinitely often

François Rodier

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.

cs.IT2014

Error-Correction Capability of Reed-Muller codes

Stéphanie Dib, François Rodier

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 al…

cs.IT2011★ 1 cited

Some More Functions That Are Not APN Infinitely Often. The Case of Kasami exponents

François Rodier

We prove a necessary condition for some polynomials of Kasami degree to be APN over F_{q^n} for large n.

math.AG2009

Bounds on the degree of APN polynomials The Case of

Gregor Leander, François Rodier

We prove that functions $f:\f{2^m} \to \f{2^m}$ of the form where is any non-affine polynomial are APN on at most a finite number of fields $\f{2^m}$. Furthe…