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


D. Augot and M. Finiasz. A public key encryption scheme based on the polynomial reconstruction problem. In Advances in Cryptology - EUROCRYPT 2003, pages 229--241, Lecture Notes in Computer Science 2656. Springer-Verlag.

D. Augot, M. Finiasz and P. Loidreau. Using the Trace Operator to repair the Polynomial Reconstruction based Cryptosystem. In Cryptology ePrint Archive, Report 2003/209.

D. Augot, M. Finiasz and N. Sendrier. A Fast Provably Secure Cryptographic Hash Function. In Cryptology ePrint Archive, Report 2003/230.

D. Augot, M. Bardet and J.C. Faugère. Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Groebner bases. In Proceedings 2003 IEEE International Symposium on Information Theory, p. 362, Yokohama, Japan, June 2003.
Research report, INRIA RR-4652.

C. Bachoc and P. Gaborit. Designs and self-dual codes with long shadows. Jour. Comb. Theory Series A, to appear.

T.P. Berger. Isometries for rank distance and permutation group of Gabidulin codes. IEEE Transactions on Information Theory, 49(11), pp. 3016-3019, November 2003.

R. Bhaskar. Group Key Agreement in Ad hoc Networks. Research report, INRIA RR-4832, Décembre 2003.

N. Brulez and É. Filiol. Analyse d'un ver ultra-rapide : Sapphire/Slammer. MISC - Le journal de la sécurité informatique, n. 8 Juillet 2003.

A. Canteaut and P. Charpin. Decomposing bent function. IEEE Trans. Inform. Theory, 49(8), pages 2004-19, August 2003.

A. Canteaut, M. Daum, G. Leander and H. Dobbertin. Normal and non normal bent functions. In Proceedings of the 2003 International Workshop on Coding and Cryptography (WCC 2003), pages 91-100, March 2003.

C. Carlet, Editeur invité. Special issue in Coding and Cryptology, in Discrete Applied Mathematics, Vol. 128, Issue 1, Mai 2003, Elsevier. Éditeurs associés : M. Girault (France Telecom R\&D-Caen), T. Helleseth (Bergen, Norvège), T. Hohøldt (Lyngby, Danemark), F. Morain (École Polytechnique, Palaiseau), N. Sendrier (INRIA-Rocquencourt).

C. Carlet. On the algebraic thickness and non-normality of Boolean function, Proceedings of 2003 IEEE Information Theory Workshop, Paris, France, pp. 147-150, 2003.

C. Carlet and E. Prouff. On plateaued Boolean functions and their constructions, Proceedings of Fast Software Encryption, FSE~2003, Lecture Notes in Computer Science, 2887, pp. 54-73, 2003.

C. Carlet and E. Prouff. On a new notion of nonlinearity relevant to multi-output pseudo-random generators, Proceedings of Selected Areas in Cryptography, SAC~2003, Lecture Notes in Computer Science, Lecture Notes in Computer Science 3006,pp. 291--305, 2004.

P. Chambet, É. Filiol and E. Detoisien. La fuite d'informations dans les documents propriétaires. MISC - Le journal de la sécurité informatique, n. 7 Mai 2003.

M. Cluzeau. Reconstruction d'un brasseur linéaire. Rapport de stage de DEA, Faculté des Sciences de Limoges, Juillet 2003.

É. Filiol. Les virus informatiques : théorie, pratique et applications. Collection Iris, Springer Verlag, XXIV, 388, ISBN 2-287-20297-8, Novembre 2003.

É. Filiol. Les virus informatiques. Techniques de l'ingénieur, Volume Sécurité informatique Novembre 2003.

É. Filiol. Les infections informatiques. MISC - Le journal de la sécurité informatique, n. 5 Janvier 2003.

É. Filiol. La lutte antivirale : techniques et enjeux. MISC - Le journal de la sécurité informatique, n. 5 Janvier 2003.

É. Filiol. Un virus de boot furtif : STEALTH. MISC - Le journal de la sécurité informatique, n. 6 Mars 2003.

É. Filiol and F. Raynal. La sécurité du WEP. MISC - Le journal de la sécurité informatique, n. 6 Mars 2003.

M. Finiasz. Words of minimal weight and weight distribution of binary Goppa codes. In Proceedings 2003 IEEE International Symposium on Information Theory, p. 70, Yokohama, Japan, June 2003.

P. Gaborit and A. Otmani. Experimental constructions of self-dual codes. Finite Fields and Applications, 9 (2003), no. 3, 372--394.

P. Gaborit, and J.-L. Kim and V. Pless. Decoding binary R(2,5) by hand. Discrete Mathematics, 264 (2003), no. 1-3, 55--73.

F. Galand. On the Minimum Distance of Some Families of Z_{2^k}-Linear Codes. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-15, Toulouse, France, may 2003. Proceedings LNCS 2643. Springer-Verlag Heidelberg.

F. Galand and G. Kabatiansky. Information Hiding by Coverings. 2003 IEEE Information Theory Workshop, Paris, France, March 2003.

F. Galand and G. Kabatiansky. Steganography via Covering Codes. In Proceedings 2003 IEEE International Symposium on Information Theory, ISIT 03, Yokohama, Japan, June 2003.

F. Levy-dit-Vehel and L. Perret. A Polly Cracker system based on satisfiability. Rapport de recherche RR-4698, INRIA, January 2003.

F. Levy-dit-Vehel and L. Perret. Polynomial equivalence problems and applications to multivariate cryptosystems. In Advances in Cryptology - INDOCRYPT 2003, Lecture Notes in Computer Science 2904, pp. 235-251, Springer-Verlag.

P. Loidreau. On the decoding of Maximum Rank Distance codes. Conférence franco-russe "Mathematics of Communication", Moscou, Russie, Novembre 2003.

P. Milman, H. Ollivier and J.M. Raimond. Universal quantum cloning in cavity QED. In Phys. Rev. A, 67:12314, 2003. Also arXiv, quant-ph 0207039.

P. Milman, H. Ollivier, Y. Yamaguchi, M. Brune,J.M. Raimond. and S. Haroche. Simple quantum information algorithms in cavity QED. In J. Mod. Opt., 50(6-7):901--913, 2003.

C. S.  Nedeloaia. Weight Distributions of Cyclic Self-Dual Codes. IEEE Trans. Inform. Theory, 49(6), pages 1582-1591, June 2003.

H. Ollivier and P. Milman. Proposal for realization of a Toffoli gate via cavity-assisted collision. In Quant. Info. Comput. J., 6, 2003. Also arXiv, quant-ph 0306064.

H. Ollivier, D. Poulin and W.H. Zurek. Emergence of objective properties from subjective quantum states: Environment as a witness. In arXiv, quant-ph:0307229, 2003.

H. Ollivier and J.P. Tillich. Description of a quantum convolutional code. In Phys. Rev. Lett., 91,17,177902, 2003. Also arXiv, quant-ph 0304189.

G. Olocco. Décodage itératif et distance minimale d'une nouvelle famille de codes auto-duaux. Thèse de doctorat, Université Paris-Sud, Orsay, Avril 2003.

G. Olocco and J.P. Tillich. A family of self-dual codes which behave in many respects like random linear codes of rate 1/2. IEEE Trans. Inform. Theory. To appear.

D. Pasalic. Degree optimized resilient Boolean functions from Maiorana-McFarland class. In Proceedings of IMA conference on Coding and Cryptography, Cirencester, England, December 2003.

D. Poulin, R. Blume-Kohout, R. Laflamme and H. Ollivier. Exponential speed-up with a single bit of quantum information: Testing the quantum butterfly effect. In arXiv, quant-ph:0310038, 2003.

A. Seznec and N. Sendrier. HAVEGE: User-level Software Heuristic for Strong Random Numbers. ACM Transactions on Modeling and Computer Simulation, 14(4),2003.

T. Roetynck. Implémentation d'un cryptosystème basé sur les codes correcteurs d'erreurs. Rapport de stage ingénieur, ENSTB, Septembre 2003.


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