Yann Laigle-Chapuy

According to our database, Yann Laigle-Chapuy authored at least 8 papers between 2005 and 2009.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2009

Polynômes de permutation et applications en cryptographie - Cryptanalyse de registres combinés. (Permutation polynomials and applications in cryptography - Cryptannalysis of the combined generator).

Yann Laigle-Chapuy

PhD thesis, 2009

Cryptanalysis of ESSENCE.

María Naya-Plasencia, Andrea Röck, Jean-Philippe Aumasson, Yann Laigle-Chapuy, Gaëtan Leurent, Willi Meier, Thomas Peyrin

IACR Cryptol. ePrint Arch., 2009

Attacking the combination generator

Frédéric Didier, Yann Laigle-Chapuy

CoRR, 2009

2007

Permutation polynomials and applications to coding theory.

Yann Laigle-Chapuy

Finite Fields Their Appl., 2007

Finding low-weight polynomial multiples using discrete logarithm.

Frédéric Didier, Yann Laigle-Chapuy

Proceedings of the IEEE International Symposium on Information Theory, 2007

A Note on a Class of Quadratic Permutations over F_2ⁿ.

Yann Laigle-Chapuy

Proceedings of the Applied Algebra, 2007

2006

On Almost Perfect Nonlinear Functions Over F₂ⁿ.

Thierry P. Berger, Anne Canteaut, Pascale Charpin, Yann Laigle-Chapuy

IEEE Trans. Inf. Theory, 2006

2005

On almost perfect nonlinear mappings over Fⁿ₂.

Thierry P. Berger, Anne Canteaut, Pascale Charpin, Yann Laigle-Chapuy

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005