Publications

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

2004

F. Arnault, T.P. Berger. Design of new pseudo-random generators based on a filtered FCSR automaton. The State of the Art of Stream Ciphers, ECRYPT Network of excellence in cryptology, Brugges, Belgium, October 14-15, 2004.

F. Arnault,T.P. Berger and A. Necer. Feedback with Carry Shift Registers synthesis with the Euclidean Algorithm. In IEEE Transactions on Information Theory , Vol. 50, No 5, pp. 910-916, May 2004.

M. Bardet. Etude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie. Thèse de doctorat, Université Paris 6, Décembre 2004.

M. Bardet,J.C. Faugère and B. Salvy. On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations. In Proceedings of ICPSS International Conference on Polynomial System Solving, Paris, November 24-25-26 2004 in honor of Daniel Lazard.

T.P. Berger and P. Loidreau. Designing an Efficient and Secure Public-Key Cryptosystem Based on Reducible Rank Codes. In Proceedings of INDOCRYPT 2004, LNCS 3348, pp. 218-229, A. Canteaut and K. Viswanathan eds.

T.P. Berger, A. Ouriski. Construction of new MDS codes from Gabidulin codes. In Proceedings of ACCT'9, p. 40-47, Kranevo, Bulgaria, June 2004.

V. Bénony, F. Recher, E. Wegrzynowski, C. Fontaine. An improved method to retrieve internal state of Klimov-Shamir pseudo-random sequence generators. In Proceedings of Sequences and their applications -- SETA 2004, November 2004, To appear.

S.  Bezrukov, R. Elsasser, B. Monien, R. Preiss, J.P. Tillich. New spectral lower bounds on the bisection width. Theoretical Computer Science, 320, 2004, p.155-174.

A. Canteaut. Decoding techniques for correlation attacks on stream ciphers. Proceedings of YACC 2004, Porquerolles, France, June 2004, Invited talk.

A. Canteaut. Comment concevoir un algorithme de chiffrement rapide et solide. La face cachée des mathématiques, Conférence organis\'e par l'IHES, la Société Mathématique de France, la Société de Mathématiques Appliquées et Industrielles et Pour la ScienceParis, France, Mars 2004.

A. Canteaut and K. Viswanathan Eds. Progress in Cryptology - INDOCRYPT 2004. LNCS 3348, 2004 Springer-Verlag.

C. Carlet. On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions highly nonlinear Mappings. Journal of Complexity , dedicated to Prof. Harald Niederreiter on the occasion of his 60th birthday, "Complexity Issue in Cryptography and Coding Theory", 20(2004) 182-204.

C. Carlet. On the degree, nonlinearity, algebraic thickness and non-normality of Boolean functions, with developments on symmetric functions. IEEE Transactions on Information Theory , vol. 50, pp. 2178-2185, 2004.

C. Carlet. On the secondary constructions of resilient and bent functions . In Coding, Cryptography and Combinatorics , Progress in Computer Science and Applied Logic, Vol. 23, Birkhäuser Verlag, Basel, pp. 3-28, 2004.

C. Carlet, H. Dobbertin, G. Leander. Normal Extensions of Bent Functions. IEEE Transactions on Information Theory , vol. 50, pp. 2873-2879, 2004.

C. Carlet, P. Charpin. Cubic Boolean functions with highest resiliency. In Proceedings 2004 IEEE International Symposium on Information Theory, p. 497, Chicago, USA, June 2004.

C. Carlet and C. Ding. Highly Nonlinear Mappings. Journal of Complexity , dedicated to Prof. Harald Niederreiter on the occasion of his 60th birthday, "Complexity Issue in Cryptography and Coding Theory", 20(2004) 205-244.

C. Carlet, P. Gaborit. Hyper-bent functions and cyclic codes. In Proceedings 2004 IEEE International Symposium on Information Theory, p. 499, Chicago, USA, June 2004.

C. Carlet and E. Prouff. Vectorial Functions and Covering Sequences, Proceedings of Finite Fields and Applications, Fq7, Lecture Notes in Computer Science 2948, G. L. Mullen, A. Poli and H. Stichtenoth edts, pp. 215-248, 2004.

F. Cayre, C. Fontaine, T. Furon. Watermarking Attack: Security of WSS Techniques. In International Workshop on Digital Watermarking -- IWDW , Lecture Notes in Computer Science, Best Paper Award, To appear.

F. Cayre, C. Fontaine, T. Furon. Watermarking security, part I: theory. In IS\&T/SPIE International Symposium on Electronic Imaging 2005 , Lecture Notes in Computer Science, Best Paper Award, To appear.

P. Charpin. Normal Boolean functions. Journal of Complexity , dedicated to Prof. Harald Niederreiter on the occasion of his 60th birthday, "Complexity Issue in Cryptography and Coding Theory", 20(2004) 245-265.

P. Charpin. Cyclic codes with few weights and Niho exponents. Jour. Comb. Theory Series A, Volume 108, Issue 2 , November 2004, Pages 247-259.

P. Charpin, T. Helleseth, V. Zinoviev. On binary BCH codes with minimal distance 8 and Kloosterman sums. In Proceedings of ACCT'9, p. 90-94, Kranevo, Bulgaria, June 2004.

M. Cluzeau. Reconstruction of a linear scrambler. In Proceedings 2004 IEEE International Symposium on Information Theory, p. 230, Chicago, USA, June 2004.

L. Dubreuil, T.P. Berger. Spread spectrum, cryptography and information hiding. In Proceedings of ACCT'9, p. 143-48, Kranevo, Bulgaria, June 2004.

C. Faure. Etude d'un cryptosystème à clé publique fondé sur le problème de reconstruction de polynômes linéaires. Rapport de stage, DEA Algorithmique. Responsable: P. Loidreau, Septembre 2004.

É. Filiol, C. Fontaine, S. Josse. The COSvd Ciphers. The State of the Art of Stream Ciphers, ECRYPT Network of excellence in cryptology, Brugges, Belgium, October 14-15, 2004.

É. Filiol. Le ver Blaster/Lovsan. MISC - Le journal de la sécurité informatique, n. 11, Janvier 2004.

É. Filiol. Le ver MyDoom. MISC - Le journal de la sécurité informatique, n. 13, Mai 2004.

É. Filiol. Le chiffrement par flot. MISC - Le journal de la sécurité informatique, n. 16, Novembre 2004.

É. Filiol. Analyses de codes malveillants pour mobiles : le ver CABIR et le virus DUTS. MISC - Le journal de la sécurité informatique, n. 16, Novembre 2004.

É. Filiol. Strong Cryptography Armoured Computer Viruses Forbidding Code Analysis: the bradley virus. Rapport de recherche INRIA , RR-5250, Juin 2004.

É. Filiol. Les infections informatiques. MISC - Revue Flux, les ingénieurs Supélec, vol. 230, Janvier 2004.

É. Filiol. Evolution des idées en virologie informatique. Dans Actes du 7ème Colloque d'Histoire de l'Informatique et des Télécommunications de Rennes, CHIR 2004, Novembre 2004.

É. Filiol. Repetition Codes Cryptanalysis of Block Ciphers. Journal of the Indian Statistical Association, Volume 42, Number 9, D\'ecembre 2004.

M. Finiasz. Nouvelles constructions utilisant des codes correcteurs d'erreurs en cryptographie à clef publique. Thèse de doctorat, Ècole Polytechnique, Palaiseau, Octobre 2004.

J. Friedman, J.P. Tillich. Wave equations for graphs and the edge-based Laplacian. Pacific Journal of Mathematics, Vol. 216, No.2, Oct. 2004, p.229-266.

E. Gabidulin, P. Loidreau. On subspaces subcodes of rank codes. In Proceedings of ACCT'9, p. 178-84, Kranevo, Bulgaria, June 2004.

P. Gaborit. Construction of new unimodular lattices. European Journal of Combinatorics, 25 (2004), p. 549-564.

P. Gaborit, O. D. King. Linear Constructions for DNA Codes. Theoretical Comp. Science, To appear.

P. Gaborit, C. S. Nedeloaia, A.  Wassermann. Weight enumerators of duadic and quadratic residue codes. In Proceedings 2004 IEEE International Symposium on Information Theory, p. 485, Chicago, USA, June 2004.

F. Galand. Constructions de codes Z_{p^k}-linéaires de bonne distance minimale, et schémas de dissimulation fondés sur les codes de recouvrements. Thèse de doctorat, Université de Caen, Décembre 2004.

G. Kabatiansky, C. Tavernier. List decoding of Reed-Muller codes. In Proceedings of ACCT'9, p. 230-35, Kranevo, Bulgaria, June 2004.

A. Klapper and C. Carlet. Spectral Methods for Cross-Correlations of Geometric Sequences, IEEE Transactions on Information Theory, Vol. 50, pp. 229-232, 2004.

Y. Laigle-Chapuy. Les polynômes de permutation. Applications en théorie des codes. Rapport de stage, DEA Algorithmique. Responsable: P. Charpin, June 2004.

F. Levy-dit-Vehel. An Attack on Public-Key Systems Based on Free Partially Commutative Monoids (joint work with L. Perret). YACC'04, Conference , Porquerolles Island, France, June 2004.

F. Levy-dit-Vehel, L. Perret. A Polly Cracker System Based on Satisfiability . In Coding, Cryptography and Combinatorics , Progress in Computer Science and Applied Logic, Vol. 23, Birkhäuser Verlag, Basel, pp. 177-192, 2004.

F. Levy-dit-Vehel, L. Perret. Attacks on Public-Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. In Progress in Cryptology - INDOCRYPT 2004, LNCS 3348, pp. 275-289, Springer-Verlag, 2004.

F. Levy-dit-Vehel, L. Perret. Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems. Rapport de recherche INRIA, RR-5119, Février 2004.

P. Loidreau. Sur la reconstruction des polynômes linéaires : un nouvel algorithme de décodage des codes de Gabidulin. Comptes Rendus de l'Académie des Sciences : Série I, V. 339, N. 10. pp. 745-750, 2004.

P. Loidreau, B. Sakkour. Modified version of Sidelnikov-Peshakov decoding algorithm for binary second order Reed-Muller codes. In Proceedings of ACCT'9, p. 266-72, Kranevo, Bulgaria, June 2004.

S. Manuel. Codes d'authentification de messages - Application aux fonctions de hachage fondées sur le décodage de syndrome rapide. Rapport de stage de maîtrise, Université Paris 8, 2004.

W. Meier, E. Pasalic, C. Carlet. Algebraic attacks and decomposition of Boolean functions. In Advances in Cryptology - EUROCRYPT 2004, Lecture Notes in Computer Science 3027, pp. 474-491, 2004.

M. Minier. A bottleneck attack on Crypton. Rapport de recherche INRIA , RR-5324, Octobre 2004.

M. Minier. A three rounds property if the AES. In Proceedings of Fourth AES Conference, LNCS 3372, pp. 16-27, Springer-Verlag 2004.

H. Ollivier. Elements de théorie de l'information quantique, décohérence et codes correcteurs d'erreurs. Thèse de doctorat, Ècole Polytechnique, Palaiseau, Septembre 2004.

H. Ollivier, P. Pajot. La décohérence, espoir du calcul quantique. La Recherche, 378, 34 (2004).

H. Ollivier, D. Poulin and W.H. Zurek. Environment as witness: selective proliferation of information and emergence of objectivity. In arXiv, quant-ph:0408125, 2004.

H. Ollivier, D. Poulin and W.H. Zurek. Objective properties from subjective quantum states: environment as a witness. Phys. Rev. Lett., 2004, To appear. Also arXiv, quant-ph 0307229.

H. Ollivier and J.P. Tillich. vQuantum convolutional codes: fundamentals. arXiv, quant-ph 0401134 (2004).

L. Perret. On the computational complexity of some equivalence problems of polynomial systems of equations over finite fields. Electronic Colloquium on Computational Complexity, ECCC Report TR04-116, 2004.

L. Perret, A. Bayad. A differential approach to a polynomial equivalence problem. In Proceedings 2004 IEEE International Symposium on Information Theory, p. 142, Chicago, USA, June 2004.

F. Petitcolas, C. Fontaine. Nouveaux outils pour l'évaluation des algorithmes de tatouage. Chapitre de Tatouage de documents audiovisuels numériques, Hermès-Lavoisier, 2004.

D. Poulin, R. Blume-Kohout, R. Laflamme and H. Ollivier. Exponential speed-up with a single bit of quantum information: measuring the average fidelity decay. Phys. Rev. Lett., 92, 17, 177906 (2004). Also arXiv, quant-ph 0310038 (2003).

N. Sendrier. Linear codes with complementary duals meet the Gibert-Varshamov bound. In Proceedings 2004 IEEE International Symposium on Information Theory, p. 456, Chicago, USA, June 2004.

N. Sendrier. Linear codes with complementary duals meet the Gibert-Varshamov bound. Discrete Mathematics, vol. 285, pp. 345-347, 2004.

C. Tavernier. Testeurs, problèmes de reconstruction univariés et multivariés, et application à la cryptanalyse du DES. Thèse de doctorat, Ècole Polytechnique, Palaiseau, Janvier 2004.

J.P. Tillich. The average weight distribution of Tanner code ensembles and a way to modify then to improve their weight distribution. In Proceedings 2004 IEEE International Symposium on Information Theory, p. 7, Chicago, USA, June 2004.

J.P. Tillich and G. Zémor. The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel. IEEE Trans. Inform. Theory. Vol. 50 , No. 2 , Fev. 2004, p.328-331.

R. Triki. Application de techniques de décodage à la cryptanalyse de systèmes de chiffrements. Rapport de stage, DEA Algorithmique. Responsables: A. Canteaut et J.P. Tillich, June 2004.

M. Videau. On some properties of symmetric Boolean functions. In Proceedings 2004 IEEE International Symposium on Information Theory, p. 500, Chicago, USA, June 2004.

M. Videau. Les algorithmes de tri. Interstices, à la découverte de l'univers des STIC, 2004.


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