Publications

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

2005

I. Andriyanova, J.P. Tillich, J.C. Carlach.g Asymptotically Good Codes with High Iterative Decoding Performances. In Proceedings 2005 IEEE International Symposium on Information Theory, pp. 850-854, ISIT 05, Adelaide, Australie, September 2005.

F. Arnault, T.P. Berger. F-FCSR: Design and properties of a new pseudo-random generator based on a filtered FCSR automaton. IEEE Transactions on Computers , to appear.

F. Arnault, T.P. Berger. F-FCSR: Design of a new class of stream ciphers. Proceedings of Fast Software Encryption, FSE~2005, Lecture Notes in Computer Science 3557, pp. 83-97, 2005.

F. Arnault, T.P. Berger, C. Lauradoux. Description of F-FCSR-8 and F-FCSR-H stream ciphers. SKEW - Symmetric Key Encryption Workshop , An ECRYPT STVL event, May 26 - 27, 2005, Aarhus, Danemark.

D. Augot, M. Finiasz, N. Sendrier. A Family of Fast Syndrome Based Cryptographic Hash Functions. In proceedings of International Conference on Cryptology in Malaysia (Mycrypt 2005), Ed Dawson and Serge Vaudenay Eds, LNCS 3715, pp. 64-83, 2005, Springer-Verlag.

D. Augot, M. Finiasz, N. Sendrier. A Family of Fast Syndrome Based Cryptographic Hash Functions. Ecrypt Conference on Hash Functions , Krakow, Poland, Juin 2005.

D. Augot, M. Finiasz, N. Sendrier. A Family of Fast Syndrome Based Cryptographic Hash Functions. Research-report RR-5592, June 2005.

D. Augot, M. Bardet, J.C. Faugère . Decoding cyclic codes with algebraic systems. Joint BeNeLuxFra Conference in Mathematics, (Joint Meeting Of The Belgian (BMS), Dutch (KWG), Luxembourg And French (SMF) Mathematical Societies), Gand, Belgique, May 2005.

D. Augot, F. Morain, C. Fontaine, J. Leneutre, S. Maag, A. Cavalli, F. Nait-Abdesselam. Review of vulnerabilities in mobile ad-hoc networks: trust and routing protocols views. ACI SERAC,délivrable de l'action concerte incitative SERAC, 2005.

M. Bardet, J.C. Faugère, B. Salvy. Complexity analysis of Gröbner bases computations for overdetermined systems, application to algebraic cryptanalysis. Joint BeNeLuxFra Conference in Mathematics, (Joint Meeting Of The Belgian (BMS), Dutch (KWG), Luxembourg And French (SMF) Mathematical Societies), Gand, Belgique, May 2005.

C. Berbain, O. Billet, A. Canteaut, N. Courtois, H. Gilbert, L. Goubin, A. Gouget, L. Granboulan, C. Lauradoux, M. Minier, T. Pornin, and H. Sibert. SOSEMANUK, a fast software-oriented stream cipher. In proceedings of SKEW - Symmetric Key Encryption Workshop, Network of Excellence in Cryptology ECRYPT , May 26 - 27, 2005, Aarhus, Danemark.
Submitted to eSTREAM, Call for Stream Cipher Primitives, Network of Excellence in Cryptology ECRYPT, http://www.ecrypt.eu.org/stream/.

C. Berbain, O. Billet, A. Canteaut, N. Courtois, B. Debraize, H. Gilbert, L. Goubin, A. Gouget, L. Granboulan, C. Lauradoux, M. Minier, T. Pornin, and H. Sibert. DECIM, a new stream cipher for hardware applications. In proceedings of SKEW - Symmetric Key Encryption Workshop, Network of Excellence in Cryptology ECRYPT , May 26 - 27, 2005, Aarhus, Danemark.
Submitted to eSTREAM, Call for Stream Cipher Primitives, Network of Excellence in Cryptology ECRYPT.

T.P. Berger, A. Canteaut, P. Charpin, Y. Laigle-Chapuy. On Almost Perfect Nonlinear mappings. In Proceedings 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australie, September 2005.

T.P. Berger, A. Canteaut, P. Charpin, Y. Laigle-Chapuy. Almost perfect nonlinear functions. Research-report RR-5774, June 2005.

T.P. Berger and P. Loidreau. How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography, 35, 63-79, April 2005.

T.P. Berger and M. Minier. Two algebraic attacks against the {F}-{FCSR}s using the {IV} mode. In Proceedings of INDOCRYPT 2005, LNCS 3797, pp. 143-54, Springer-Verlag, 2005.

R. Bhaskar. Group Key Agreement in Ad hoc Networks. Journées "Codage et Cryptographie" 2005, Aussois, 30 Jan - 4 Feb 2005.

R. Bhaskar, D. Augot, V. Issarny, D. Sacchetti. An Efficient Group Key Agreement Protocol for Ad hoc Networks. IEEE Workshop on Trust, Security and Privacy in Ubiquitous Computing, 12-16 June 2005, Taormina, Italy.

L. Budaghyan, C. Carlet et A. Pott New Classes of Almost Bent and Almost Perfect Nonlinear Polynomials. In Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen (Norway) pages 306-15, March 2005.

T. Camara, H. Ollivier, J.P. Tillich. Constructions of quantum LDPC codes. In proceedings of EQUIS2005, ERATO conference on quantum information science, 2005.

A. Canteaut (Ed.), D. Augot, A. Biryukov, A. Braeken, C. Cid, H. Dobbertin, H. Englund, H. Gilbert, L. Granboulan, H. Handschuh, M. Hell, T. Johansson, A. Maximov, M. Parker, T. Pornin, B. Preneel, M. Robshaw, M. Ward. Open Research Areas in Symmetric Cryptography and Technical Trends in Lightweight Cryptography . Rapport du réseau d'excellence européen ECRYPT, 82 pages, 2005.

A. Canteaut. Open problems related to algebraic attacks on stream ciphers . In Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen (Norway), pages 1-11, March 2005, Invited talk.

A. Canteaut. Fast Correlation Attacks Against Stream Ciphers and Related Open Problems . In Proceedings of 2005 IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security (ITW 2005), Awaji Island, Japon, October 2005. Invited talk.

A. Canteaut. Le chiffrement à flot . Ecole de Jeunes Chercheurs en Algorithmique et Calcul Formel, Montpellier, France, Avril 2005.

A. Canteaut. A5/1; Berlekamp-Massey algorithm; Combination generator; Correlation attack; Fast correlation attack; Filter generator; Inversion attack; Linear complexity; Linear consistency attack; Linear cryptanalysis for stream ciphers; Linear feedback shift register; Linear syndrome attack; Minimal polynomial; Running-key; Stream cipher . Encyclopedia of cryptography and security, H.C.A. van Tilborg Ed., Springer, 2005.

A. Canteaut. Decoding techniques for correlation attacks on stream ciphers . Academy Contact Forum "Coding theory and cryptography", The royal Flemish academy of Belgium for science and the arts, Bruxelles, Belgique, October 2005.

A. Canteaut and M. Videau. Symmetric Boolean functions. Regular paper in IEEE Trans. Inform. Theory, Vol. 51, N. 8, pp. 2791-2811, 2005.

C. Carlet. Concatenating indicators of flats for designing cryptographic functions. Designs, Codes and Cryptography , 36, 189-202, 2005.

C. Carlet. On highly nonlinear S-boxes and their inability to thwart DPA attacks. In Proceedings of INDOCRYPT 2005, LNCS 3797, pp. 49-62, Springer-Verlag, 2005.

C. Carlet. Designing bent functions and resilient functions from known ones, without extending their number of variables. In Proceedings 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australie, September 2005.

C. Carlet. Boolean functions; Correlation immune and resilient Boolean functions; Nonlinearity of Boolean functions; Propagation characteristics of Boolean functions. Encyclopedia of cryptography and security, H.C.A. van Tilborg Ed., Springer, 2005.

C. Carlet, P. Charpin. Cubic Boolean functions with highest resiliency. Regular paper in IEEE Transactions on Information Theory, Vol. 51, No 2, pp. 562-71, February 2005.

C. Carlet, C. Ding, J. Yuan. Linear Codes from Perfect Nonlinear Mappings and their Secret Sharing Schemes. Regular paper in IEEE Transactions on Information Theory, Vol. 51, pp. 2089-2103, 2005.

C. Carlet, C. Ding. Nonlinearities of S-boxes. Finite Fields and Their Applications, to appear.

C. Carlet, P. Gaborit. On the construction of balanced Boolean functions with a good algebraic immunity. In Proceedings 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australie, September 2005.

C. Carlet, S. Mesnager. Improving the upper bounds on the covering radii of Reed-Muller codes. In Proceedings 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australie, September 2005.

C. Carlet, J.L. Yucas. Piecewise Constructions of Bent and Almost Optimal Boolean Functions. Designs, Codes and Cryptography, to appear.

P. Charpin. Cyclic codes ; Reed-Muller codes. Encyclopedia of cryptography and security, H.C.A. van Tilborg Ed., Springer, 2005.

P. Charpin, T. Helleseth, V. Zinoviev. The Coset Distribution of Triple-Error-Correcting Binary Primitive BCH Codes. In Proceedings 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australie, September 2005.

P. Charpin, T. Helleseth, V. Zinoviev. On cosets of weight 4 of binary BCH codes of length 2^m (m odd), with minimal distance 8, and exponential sums. In Problems of Information Transmission. Vol. 41, n. 4, pp. 331-348, 2005.

P. Charpin and E. Pasalic. Highly nonlinear resilient functions through disjoint codes in projective spaces. Designs, Codes and Cryptography, 37, 319-346, 2005.

P. Charpin, E. Pasalic, C. Tavernier. On bent and semi-bent quadratic Boolean functions. Regular paper in IEEE Transactions on Information Theory. Vol. 51, N. 12, pp. 4286-4298, December 2005.

M. Cluzeau. Reconstruction d'un brasseur linéaire. Ecole de Jeunes Chercheurs en Algorithmique et Calcul Formel, Montpellier, France, Avril 2005.

C. Faure, P. Loidreau. A new public-key cryptosystem based on the problem of reconstruction of p-polynomials . In Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen (Norway), pages 275-85, March 2005.

É. Filiol. Computer viruses: from theory to applications. IRIS International series, Springer Verlag, ISBN 2-287-23939-1, juin 2005.

É. Filiol. Strong Cryptography Armoured Computer Viruses Forbidding Code Analysis: the bradley virus. In Proceedings of the 14th EICAR Conference, pp. 201-217, 2005.

É. Filiol. SCOB/PADODOR : quand les codes malveillants collaborent. MISC - Le journal de la sécurité informatique, n. 17, Janvier 2005.

É. Filiol. Le virus perrun : méfiez vous des images... et des rumeurs. MISC - Le journal de la sécurité informatique, n. 18, Mars 2005.

É. Filiol. Le virus whale : le virus se rebiffe. MISC - Le journal de la sécurité informatique, n. 19, Mai 2005.

É. Filiol. Cryptologie malicieuse ou virologie cryptologique ? MISC - Le journal de la sécurité informatique, n. 20, Juillet 2005.

É. Filiol. Le virus Ymun : la cryptanalyse sans peine. MISC - Le journal de la sécurité informatique, n. 20, Juillet 2005.

É. Filiol. Le virus Bradley ou l'art du blindage total. MISC - Le journal de la sécurité informatique, n. 20, Juillet 2005.

É. Filiol. Evaluation des logiciels antiviraux : quand le marketing s'oppose à la technique. MISC - Le journal de la sécurité informatique, n. 21, Septembre 2005.

É. Filiol. La simulabilité des tests statistiques. MISC - Le journal de la sécurité informatique, n. 22, Novembre 2005.

J. Friedman, J.P. Tillich. Generalized Alon-Boppana Theorems and Error-Correcting Codes. SIAM Journal of Discrete Mathematics, vol. 19, n. 3, pp. 700-718, 2005.

E. Gabidulin, P. Loidreau. On subcodes of codes in rank metric. In Proceedings 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australie, September 2005.

P. Gaborit. Clés plus courtes pour les cryptosystèmes de chiffrement basés sur des codes. Journées "Codage et Cryptographie" 2005, Aussois, 30 Jan - 4 Feb 2005.

P. Gaborit. Shorter keys for code based cryptography . In Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen (Norway) pages 81-91, March 2005.

P. Gaborit, C. S. Nedeloaia, A.  Wassermann. Weight enumerators of duadic and quadratic residue codes. IEEE Transactions on Information Theory, Vol. 51, no. 1, pp. 402-407, January 2005.

D. Heitzler. Etude des propriétés cryptographiques des T-fonctions . Stage de Maîtrise Ingénierie Mathématiques, Université de Cergy-Pontoise, Septembre 2005. Responsable : A. Canteaut.

G. Kabatiansky, E. Krouk, S. Semenov. Error Correcting Codes and Security for Data Networks. John Willey & Sons Ltd, ISBN 0-470-86754-X,2005, 278 pages.

G. Kabatiansky. Codes for copyright protection:the case of two pirates . Information Transmission Problems, vol.41, no. 2, pp.123-127,2005.

G. Kabatiansky, C. Tavernier. List decoding of second order Reed-Muller codes. In Proceedings of Eight International Simposium on Communication Theory and Applications, Ambelside, UK,July 2005.

Y. Laigle-Chapuy. Les polynômes de permutation. Applications en théorie des codes. Journées "Codage et Cryptographie" 2005, Aussois, 30 Jan - 4 Feb 2005.

C. Lauradoux. Collision attacks on processors with cache and countermeasures. WeWork 2005, Western European Workshop on Research in Cryptology, Leuven, Belgium, July 2005.

C. Lauradoux. Timing Attack et Hyperthreading. MISC - Le journal de la sécurité informatique, n. 20, Juillet 2005. Version allemande dans MISC : Multi-System, Internet, Security & Cookbook, n. 1, Sept. 2005.

C. Lauradoux. Machine virtuelle et Honeypot. MISC - Le journal de la sécurité informatique, n. 21, Septembre 2005. Version allemande dans MISC : Multi-System, Internet, Security & Cookbook, n. 1, Sept. 2005.

C. Lauradoux. Complexité des fonctions booléennes symétriques. Ecole de Jeunes Chercheurs en Algorithmique et Calcul Formel, Montpellier, France, Avril 2005.

C. Lauradoux. Machine Virtuelle et Pot de miel. Ecole Internet Nouvelle Génération, ING 2005, Montreuil sur Mer, France, Juillet 2005.

F. Levy-dit-Vehel, L. Perret. On Wagner-Magyarik cryptosystem . In Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen (Norway), pages 285-95, March 2005.

P. Loidreau. A Welch-Berlekamp like algorithm for decoding Gabidulin codes . In Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen (Norway), pages 30-39, March 2005.

P. Loidreau. Pour quelques bits d'information. MISC - Le journal de la sécurité informatique, n. 20, Juillet 2005.

P. Loidreau. An Algebraic attack against Augot-Finiasz cryptosystem. Research-report RR-5662, Aout 2005.

M. Minier. LILI-128 et ses attaques. Journées "Codage et Cryptographie" 2005, Aussois, 30 Jan - 4 Feb 2005.

M. Minier. An Integral Cryptanalysis of a five rounds version of FOX. WeWork 2005, Western European Workshop on Research in Cryptology, Leuven, Belgium, July 2005.

C.S. Nedeloaia. Upper Bounds on the Dual Distances of EBCH Codes. Rapport de recherche INRIA , RR-5477, Janvier 2005.

C.S. Nedeloaia. Étude des énumérateurs des poids des codes linéaires utilisant des formes décomposées des matrices génératrices. Thèse de doctorat, Université de Limoges, Février 2005.

H. Ollivier, J.P. Tillich. Interleaved serial concatenation of quantum convolutional codes: gate implementation and iterative error estimation algorithm. Actes du 26th Symposium on Information Theory in the Benelux, p. 149, Bruxelles, Belgique, 2005.

L. Perret. Etude d'outils algébriques et combinatoires pour la cryptographie à clef publique. Thèse de doctorat, Université de Marne-la-Vallée, 17 octobre 2005.

L. Perret. A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem. In Advances in Cryptology - EUROCRYPT 2005, LNCS 3494, pp. 354-71, Springer-Verlag, 2005.

L. Perret. A chosen ciphertext attack on a public key cryptosystem based on Lyndon words . In Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen (Norway) pages 235-45, March 2005.

L. Perret. Algorithms for solving the isomorphism of polynomials with one secret problem, Joint BeNeLuxFra Conference in Mathematics, (Joint Meeting Of The Belgian (BMS), Dutch (KWG), Luxembourg And French (SMF) Mathematical Societies), Gand, Belgique, May 2005.

V.V. Shorin, P. Loidreau. Application of Groebner bases Techniques for searching new sequences with good periodic correlation properties. In Proceedings 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australie, September 2005.

N. Sendrier. Encoding information into constant weight words. In Proceedings 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australie, September 2005.

N. Sendrier. Public-key cryptology based on error-correcting codes. CAEN'05, Juin 2005. Conférence invitée.

N. Sendrier. McEliece public key cryptosystem. Encyclopedia of cryptography and security, H.C.A. van Tilborg Ed., Springer, 2005.

M. Videau. Critères de sécurité des algorithmes de chiffrement à clé secrète. Thèse de doctorat, Université Pierre et Marie Curie (Paris 6), 6 Novembre 2005.

M. Videau. Symmetric Boolean functions with high nonlinearity. WeWork 2005, Western European Workshop on Research in Cryptology, Leuven, Belgium, July 2005.


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