Publications

2014+ (all publications are available in hal after 2014)

2001

T.P. Berger and L. de Maximy. Cyclic projective Reed-Muller codes. In Applied Algebra, Algebraic Algorithms and Error Correcting Codes - AAECC-14, number 2227 in LNCS, pages 77-81. Springer-Verlag, 2001.

E. Cadic, J-C. Carlach, G. Olocco, A. Otmani, and J.P. Tillich.
Low complexity tail-biting trellises of self-dual codes of length 24, 32 and 40 over GF(2) and Z4 of large minimum distance. In Applied Algebra, Algebraic Algorithms and Error Correcting Codes - AAECC-14, number 2227 in LNCS, pages 57-66. Springer-Verlag, 2001.

A. Canteaut, C. Carlet, P. Charpin, and C. Fontaine. On cryptographic properties of the cosets of R(1,m). IEEE Transactions on Information Theory, 47(4):1494-1513, 2001. Regular Paper.

A. Canteaut and F. Lévy-dit-Véhel. La cryptologie moderne (1). L'Armement, 73:76-83, March 2001.

A. Canteaut and F. Lévy-dit-Véhel. La cryptologie moderne (2). L'Armement, 74:139-142, June 2001.

A. Canteaut. On the weight distributions of optimal cosets of the First-Order Reed-Muller Codes. IEEE Transactions on Information Theory, 47(1):407-413, 2001.

A. Canteaut. Cryptographic functions and design criteria for block ciphers. In Progress in Cryptology - INDOCRYPT 2001, number 2247 in LNCS, pages 1-16. Springer-Verlag, 2001. Article invité.

C. Carlet and S. Dubuc. On generalized bent and q-ary perfect nonlinear functions. In Finite fields and Applications (5th International Conference on Finite Fields), pages 81-94. Springer-Verlag, 2001.

C. Carlet and P. Guillot. Bent, resilient functions and the numerical normal form. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 56, pages 87-96. AMS, 2001.

C. Carlet. On the coset weight divisibility and nonlinearity of resilient and correlation-immune functions. In Proceedings de SETA 2001 (Sequences and their Applications), Discrete Mathematics and Theoretical Computer Science, pages 131-144, Bergen, Norvège, May 2001. Springer-Verlag.

P. Charpin, A. Tietavainen, and V. Zinoviev. On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property. IEEE Transactions on Information Theory, 47(1):421-425, January 2001.

N. Courtois, M. Finiasz, and N. Sendrier. How to achieve a McEliece-based digital signature scheme. In Advances in Cryptology - ASIACRYPT 2001, number 2248 in LNCS, pages 157-174. Springer-Verlag, 2001.

É. Filiol and C. Fontaine. A new ultrafast stream cipher design: COS ciphers. In 8th IMA Conference on Cryptography and Coding, number 2260 in LNCS, pages 85-98, Cirencester, Royaume-Uni, December 2001. Springer-Verlag.

É. Filiol, C. Fontaine, and D. Vianne. A new, fast block cipher design: COS ciphers. In Proceedings 2001 IEEE International Symposium on Information Theory, page 138, Washington D.C., USA, June 2001.

É. Filiol. Technique de reconstruction en cryptologie et théorie des codes. Thèse de doctorat, École Polytechnique, March 2001.

P. Loidreau and N. Sendrier. Weak keys in McEliece public-key cryptosystem. IEEE Transactions on Information Theory, 47(3):1207-1212, March 2001.

P. Loidreau. Codes derived from binary Goppa codes. Problems of Information Transmission, 37(2):91-9, 2001. Traduction de Problemy Peredachi Informatsii.

P. Loidreau. Étude et optimisation de cryptosystèmes à clé publique fondés sur la théorie des codes correcteurs. Thèse de doctorat, École Polytechnique, May 2001.

P. Loidreau. Introduction à la cryptographie. Linux magazine - Hors-série << Sécurité >>, 8, 2001.

G. Olocco and J.-P. Tillich. A family of self-dual codes which behaves in many respects like random linear codes of rate 1/2. In Proceedings 2001 IEEE International Symposium on Information Theory, Washington D.C., USA, July 2001. IEEE.

L. Pecquet. Construction et décodage des codes géométriques. Thèse de doctorat, Université Paris 6, December 2001.

N. Sendrier and G. Skersys. On the computation of the automorphism group of a linear code. In Proceedings 2001 IEEE International Symposium on Information Theory, Washington D.C., USA, June 2001.

J. Stern and J.-P. Tillich. Automatic detection of a watermarked document using a private key. In Proceedings Information Hiding, 4th International Workshop, (IHW 2001), number 2137 in LNCS, pages 258-272. Springer-Verlag, 2001.

A. Valembois. Fast soft-decision decoding of linear codes, stochastic resonance in algorithms. In Proceedings 2000 IEEE International Symposium on Information Theory, page 91, Sorrente, Italie, June 2000. IEEE.

A. Valembois. Detection and recognition of a binary linear code. Discrete Applied Mathematics, 111(1-2):199-218, July 2001.


People

Head of project-team

  • Anne Canteaut
  • Vice-leader

  • Nicolas Sendrier
  • Administrative assistant

  • Christelle Guiziou
  • Research scientists

  • André Chailloux
  • Pascale Charpin
  • Gaëtan Leurent
  • Anthony Leverrier
  • María Naya-Plasencia
  • Jean-Pierre Tillich
  • Other researchers

  • Christina Boura
  • Post-doc researchers

  • Léo Perrin
  • Ph.D. students

  • Xavier Bonnetain
  • Rémi Bricout
  • Kevin Carrier
  • Rodolfo Canto Torres
  • Kaushik Chakraborty
  • Thomas Debris
  • Sébastien Duval
  • Shouvik Ghorai
  • Antoine Grospellier
  • Adrien Hauteville
  • Matthieu Lequesne
  • Vivien Londe
  • Andrea Olivo
  • Yann Rotella
  • André Schrottenloher
  • Ferdinand Sibleyras
  • Valentin Vasseur
  • External collaborators

    Former members