Projet CODES -- publications 1995 -2007 --

2007

I. Andriyanova and J.P. Tillich. A family of non-binary TLDPC codes: density evolution, convergence and thresholds. In Proceedings of the 2007 IEEE International Symposium on Information Theory, pp. 1216-1220, ISIT 07, Nice, FRANCE, june 2007.

F. Arnault, T.P. Berger, C. Lauradoux and M. Minier. X-FCSR: a new software oriented stream cipher based upon FCSRs. In Proceedings of INDOCRYPT 2007, December 2007, Chennai, INDIA, LNCS, Springer-Verlag, to appear.

D. Augot. Décodage des codes algébriques et cryptographie . Habilitation à diriger les recherches, Université Paris 6, 7 Juin 2007.

D. Augot. On the Newton's identities for decoding cyclic codes with Grobner basis . The Claude Shannon workshop on Coding and Cryptography. May 2007, Cork, Ireland. Invited talk.

D. Augot, M. Bardet and J.C Faugère. On formulas for decoding binary cyclic codes. In Proceedings of the 2007 IEEE International Symposium on Information Theory, pp. 2646-2650, ISIT 07, Nice, FRANCE, june 2007.

D. Augot, R. Bhaskar, V. Issarny, D. Sacchetti. A Three Round Authenticated Group Key Agreement Protocol for Ad hoc Networks. Elsevier Journal on Pervasive and Mobile Computing, Volume 3, Issue 1, January 2007, Pages 36-52.

S. Babbage, C. de Cannière, A. Canteaut, C. Cid, H. Gilbert, T. Johansson, C. Paar, M. Parker, B. Preneel, V. Rijmen, M. Robshaw, H. Wu. eSTREAM - Short Report on the End of the Second Phase. ECRYPT Report, Mars 2007. [pdf]

F. Banat-Berger and A. Canteaut. Intégrité, signature et processus d'archivage. La Sécurité aujourd'hui dans la société de l'information, S. Lacour Ed., edition L'Harmattan, 213--235, 2007.

I. Ben Slimen. Les problèmes de réconciliation dans les protocoles quantiques d' échange de clés . Rapport de stage de Master de l'ENIT, Mai 2007. Direction : J.P. Tillich.

T. Camara, H. Ollivier and J.P. Tillich. A class of quantum LDPC codes: construction and performances under iterative decoding. In Proceedings of the 2007 IEEE International Symposium on Information Theory, pp. 811-815, ISIT 07, Nice, FRANCE, june 2007.

A. Canteaut. Boolean Functions for cryptography ECRYPT PhD SUMMER SCHOOL , Emerging Topics in Cryptographic Design and Cryptanalysis, 30 April - 4 May 2007, Samos, Greece. Invited talk.

A. Canteaut, P. Charpin and G. Kyureghyan. A new class of monomial bent functions, Finite Fields and Application . In Press.

A. Canteaut (ed.), D. Augot, C. Cid, H. Englund, H. Gilbert, M. Hell, T. Johansson, M. Parker, T. Pornin, B. Preneel, M. Robshaw. D.STVL.5 -- Ongoing Research Areas in Symmetric Cryptography. ECRYPT Report, Mars 2007, 93 pages.

C. Chabot. Recognition of a code in a noisy environment. In Proceedings of the 2007 IEEE International Symposium on Information Theory, pp. 221-2215, ISIT 07, Nice, FRANCE, june 2007.

P. Charpin and G. Kyureghyan. Cubic monomial bent functions: a subclass of M . SIAM J. of Discrete Math. . To appear.

P. Charpin, T. Helleseth, V. Zinoviev. On binary primitive BCH codes with minimum distance 8 and exponential sums. In Proceedings of the 2007 IEEE International Symposium on Information Theory, pp. 1976-1980, ISIT 07, Nice, FRANCE, june 2007.

P. Charpin, T. Helleseth, V. Zinoviev. The divisibility modulo 24 of Kloosterman sums on GF(2^m), m odd. Jour. Comb. Theory, Series A 114(2007), Issue 2, pp. 322-338.

P. Charpin, T. Helleseth, V. Zinoviev. Propagation characteristics of x --> 1/x and Kloosterman sums. In Finite Fields and Applications, 13 (2007), Issue 2, 366-381.

M. Cluzeau. Reconstruction of a Linear Scrambler. IEEE Transactions on Computers, vol. 56, n. 9, pp. 1283-1291, September 2007.

D. Dalai and S. Maitra. Balanced Boolean functions with (more than) maximum algebraic immunity. In Proceedings of the Workshop on Coding and Cryptography , WCC 07, pp 99-108, April 2007, Versailles, France.

F. Didier. Attacking the filter generator by finding zero inputs of the filtering function, In Proceedings of INDOCRYPT 2007, December 2007, Chennai, INDIA, LNCS, Springer-Verlag, to appear.

F. Didier and Y. Laigle-Chapuy . Finding low-weight polynomial multiples using discrete logarithms. In Proceedings of the 2007 IEEE International Symposium on Information Theory, pp. 1036-1040, ISIT 07, Nice, FRANCE, june 2007.

M. Finiasz, Ph. Gaborit and N. Sendrier. Improved fast syndrome based cryptographic hash function . In Proceedings of ECRYPT Hash Workshop 2007, Barcelona, SPAIN, May 2007.

Ph. Gaborit, C. Laudaroux, N. Sendrier. SYND: a Very Fast Code-Based Cipher Stream with a Security Reduction. In Proceedings of the 2007 IEEE International Symposium on Information Theory, pp. 186-190, ISIT 07, Nice, FRANCE, june 2007.

B. Gérard. Utilisation de techniques de codage correcteur d'erreurs pour la cryptanalyse de systèmes de chiffrement à clé secrète . Rapport de stage de Master d'Algèbre Appliquée, Université de Versailles-St Quentin, Avril-Juin 2007. Direction : J.P. Tillich.

F. Giton. Etude de l'algorithme cyclotomique de transformée de Fourier de Sidorenko . Rapport de stage de Master "Cryptographie et Codage", Université de Limoges, Septembre 2007. Direction : D. Augot.

Y. Laigle-Chapuy. Permutation Polynomials and applications to coding theory. Finite Fields and Applications , 13 (2007), Issue 1, 58-70.

Y. Laigle-Chapuy. A note on a class of quadratic permutations over F_2ⁿ, In Proceedings of AAECC 17, December 2007, Bangalore, INDIA, LNCS, Springer-Verlag, to appear.

C. Lauradoux. Throughput/code size tradeoff for stream ciphers In Proceedings of SASC 2007 - ECRYPT Workshop on stream ciphers, January 2007, Bochum, Germany.

C. Lauradoux. From Hardware to Software Synthesis of Linear Feedback  Shift Registers. In Proceedings of Workshop on Performance Optimization for High-Level Languages and  Libraries - POHLL 2007 , March, 2007, Long Beach, USA

C. Lauradoux. Conception et synthèse en cryptographie symétrique. Thèse de doctorat, Ècole Polytechnique, Palaiseau, Juin 2007.

C. Lauradoux, É. Filiol. L'apocalypse du commerce en ligne aura-t-elle lieu ? MISC - Le journal de la sécurité informatique, n. 29, Mars 2007.

P. Loidreau. Métrique rang et cryptographie . [.pdf] . Habilitation à diriger les recherches, Université Paris 6, Janvier 2007.

S. Maitra, S. Sarkar, D.K. Dalai. On Dihedral Group Invariant Boolean Functions, Workshop on Boolean Functions :Cryptography and Applications, (BFCA07), May 2-3, 2007, Paris, FRANCE.

S. Manuel and N. Sendrier. XOR-Hash : A Hash Function Based on XOR, In Proceedings of WeWork 2007, Western European Workshop on Research in Cryptology, July 4-6, 2007, Ruhr-University, Bochum, Germany.

M. Naya-Plasencia. Cryptanalysis of Achterbahn-128/80 In Proceedings of SASC 2007 - ECRYPT Workshop on stream ciphers, January 2007, Bochum, Germany.

M. Naya-Plasencia. Cryptanalysis of Achterbahn-128/80 In Proceedings of Fast Software Encryption, FSE~2007, Lecture Notes in Computer Science, n. 4593, pp. 73-86, 2007.

M. Naya-Plasencia. Cryptanalysis of Achterbahn-128/80 with a new Keystream Limitation In Proceedings of WeWork 2007, Western European Workshop on Research in Cryptology, July 4-6, 2007, Ruhr-University, Bochum, Germany.

M. Naya-Plasencia. Cryptanalyse de Achterbahn-128/80 avec une nouvelle limitation de suite chiffrante, MajecSTIC 2007, , 29-31 Octobre, 2007, Caen, France.

A. Otmani, J.P. Tillich and I. Andriyanova. On the Minimum Distance of Generalized LDPC Codes. In Proceedings of the 2007 IEEE International Symposium on Information Theory, pp. 751-755, ISIT 07, Nice, FRANCE, june 2007.

A. Röck. The Impact of Entropy Loss Caused by Random Functions, In Proceedings of WeWork 2007, Western European Workshop on Research in Cryptology, July 4-6, 2007, Ruhr-University, Bochum, Germany.

A. Röck. Attaques par collision basées sur la perte d'entropie causée par des fonctions aléatoires, MajecSTIC 2007, , 29-31 Octobre, 2007, Caen, France.

B. Sakkour. Étude et amélioration du décodage des codes de Reed-Muller d'ordre deux. Thèse de doctorat, Ècole Polytechnique, Palaiseau, Avril 2007.

N. Sendrier. Codes based One-way functions ECRYPT PhD SUMMER SCHOOL , Emerging Topics in Cryptographic Design and Cryptanalysis, 30 April - 4 May 2007, Samos, Greece. Invited talk.

2006

I. Andriyanova, J.-P. Tillich, J.-C. Carlach. A new family of codes with high iterative decoding performances. In Proceedings of ICC 2006 - IEEE International Conference on Communications, June 2006, Istambul, Turquie.

F. Armknecht, C. Carlet, P. Gaborit, S. Künzli, W. Meier, O. RuattaL. Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks. In Advances in Cryptology - EUROCRYPT 2006, LNCS , Springer-Verlag, 2006.

F. Arnault, T.P. Berger, C. Lauradoux. Update on F-FCSR Stream Cipher. In Proceedings of SASC 2006 - ECRYPT Workshop on stream ciphers, February 2006, Leuwen, Belgium.

D. Augot, Mikhail Stepanov Interpolation based decoding of Reed-Muller codes , Gröbner Bases in Cryptography, Coding Theory, and Algebraic Combinatorics , RICAM, University of Linz, Austria, May 2006. Invited talk.

D. Augot, M. El-Khamy, R.J. McEliece, F. Parvaresh, M. Stepanov, A. Vardy. Algebraic List Decoding of Reed-Solomon product codes . In Proceedings of Algebraic and Combinatorial Coding Theory, ACCT-10, Zvenigorod, Russia, September 2006.

D. Augot, A. Biryukov, A. Canteaut, C. Cid, N. Courtois, C. De Cannière, H. Gilbert, C. Lauradoux, M. Parker, B. Preneel, M. Robshaw and Y. Seurin. D.STVL.2 -- AES Security Report. ECRYPT Report, Janv. 2006. [pdf]

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 v2. [pdf] In proceedings of SASC 2006 - ECRYPT Workshop on stream ciphers, Feb 2006, Leuven, Belgium.

T.P. Berger, A. Canteaut, P. Charpin, Y. Laigle-Chapuy. On Almost Perfect Nonlinear mappings. IEEE Trans. Inform. Theory, vol. 52, n. 9, pp.4160-70, September 2006.

R. Bhaskar. Protocoles Cryptographiques pour les réseaux Ad hoc. Thèse de doctorat, Ecole Polytechnique, 26 Juin 2006.

R. Bhaskar, J. Herranz, F. Laguillaumie. Efficient Authentication for Reactive Routing Protocols. In Proc. of Second International Workshop on Security in Networks and Distributed Systems , Vienna, Austria , April 2006.

R. Bhaskar, J. Herranz, F. Laguillaumie. Aggregate Designated Verifier Signatures and Application to Secure Routing. International Journal of Security and Networks , Special Issue on Cryptography in Networks, to appear.

L. Budaghyan, C. Carlet, P. Felke, G. Leander. An infinite class of quadratic APN functions which are not equivalent to power mappings. In Proceedings of the 2006 IEEE International Symposium on Information Theory, ISIT 06, Seattle, USA, july 2006.

A. Canteaut. Open problems related to algebraic attacks on stream ciphers . In Workshop on Coding and Cryptography - WCC 2005, number 3969 in Lecture Notes in Computer Science, pp. 120-134, Springer, 2006, invited paper.

A. Canteaut. Analyse et conception de chiffrements à clef secrète . Habilitation à diriger les recherches, Université Paris 6, Septembre, 2006.

A. Canteaut. Parcours et fiches sur les générateurs pseudo-aléatoires et le chiffrement à flot , Portail Internet Cryptologie et Sécurité de l'Information}, 2006.

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. D.STVL.4 -- Ongoing Research Areas in Symmetric Cryptography. ECRYPT Report, January 2006. [pdf]

A. Canteaut, P. Charpin and G. Kyureghyan. A new class of monomial bent functions . In Proceedings of the 2006 IEEE International Symposium on Information Theory, ISIT 06, Seattle, USA, july 2006.

A. Canteaut, M. Daum, G. Leander and H. Dobbertin. Normal and non normal bent functions. In Discrete Applied Mathematics , Special issue in Coding and Cryptology, Vol. 154, Issue 2, pp. 202-18, February 2006.

A. Canteaut, C. Lauradoux and A. Seznec. Understanding cache attacks. INRIA Research-report RR-5881, Avril 2006.

C. Carlet, C. Ding, H. Niederreiter. Authentication Schemes from Highly Nonlinear Functions. Designs, Codes and Cryptography, Volume 40, Number 1, pp. 71-79, July 2006.

C. Carlet, D.K. Dalai, K.C. Gupta, S. Maitra. Algebraic immunity for cryptographically significant Boolean functions: analysis and construction , IEEE Transactions on Information Theory, Vol. 52, N. 7, pp. 3105-3121, July 2006.

C. Carlet, P. Gaborit. Hyper-bent functions and cyclic codes. Jour. Comb. Theory Series A 113(2006), 466-482.

P. Charpin, T. Helleseth, V. Zinoviev. The Coset Distribution of Triple-Error-Correcting Binary Primitive BCH Codes. IEEE Transactions on Information Theory, Vol. 52, N. 4, pp. 1727-1732, 2006.

P. Charpin, G. Kabatiansky,(Eds). Special issue in Coding and Cryptology, in Discrete Applied Mathematics, Vol. 154, Issue 2, February 2006. Éditeurs associés : A. Barg (U. of Maryland, USA), H. Gilbert (France Telecam R\&D), T. Klove (Bergen, Norvège), J. Massey (U. of Lund, Suède), G. Zémor (ENST, Paris).

P. Charpin and G. Kyureghyan. On cubic bent functions in the class M . In Proceedings of Algebraic and Combinatorial Coding Theory, ACCT-10, Zvenigorod, Russia, September 2006.

M. Cluzeau. Block code reconstruction using iterative decoding techniques. In Proceedings of the 2006 IEEE International Symposium on Information Theory, ISIT 06, Seattle, USA, july 2006.

M. Cluzeau. Reconnaissance d'un schema de codage, Thèse de doctorat, Ecole Polytechnique, 28 Novembre 2006.

I. Dumer G. Kabatiansky, C. Tavernier. List decoding of second order Reed-Muller codes up to the Johnson bound with almost linear complexity . In Proceedings of the 2006 IEEE International Symposium on Information Theory, ISIT 06, pp. 138-142, Seattle, USA, july 2006.

M. Diarra. Analyse de la sécurité d'un protocole d'identification pour les RFID. Stage d'option, Ecole Polytechnique, Juillet 2006. Direction : N. Sendrier.

F. Didier. A new bound on the block error probability after over the erasure channel. IEEE Transactions on Information Theory, vol. 52, n. 10, pp. 4496-4503, October 2006.

F. Didier. Using Wiedemann's algorithm to compute the immunity against algebraic and fast algebraic attacks. Proceedings of Indocrypt 2006, LNCS 4329, December 2006, pp. 236-250.

F. Didier, J.P. Tillich. Computing the Algebraic Immunity Efficiently. Proceedings of Fast Software Encryption, FSE~2006, LNCS 4047, 2006, pp. 359-374.

H. Dobbertin, G. Leander, A. Canteaut, C. Carlet, P. Felke, P. Gaborit. Construction of bent functions via Niho power functions. Jour. Comb. Theory Series A, Vol. 113, Issue 5, pp. 779-798, July 2006.

C. Faure. Average number of Gabidulin codewords within a sphere . In Proceedings of Algebraic and Combinatorial Coding Theory, ACCT-10, Zvenigorod, Russia, September 2006.

C. Faure, P. Loidreau. A new public-key cryptosystem based on the problem of reconstruction of p-polynomials . In Workshop on Coding and Cryptography - WCC 2005, number 3969 in Lecture Notes in Computer Science, pp. 304-315, Springer, 2006.

M. Finiasz. Syndrome decoding in the non-standard cases, In CLC 2006, September 2006, Darmstadt, Germany. Invited talk.

J. Friedman, R. Murty, J.P. Tillich. Spectral estimates for Abelian Cayley graphs. Journal of Combinatorial Theory Ser.B, vol. 96, n. 1, pp. 111-121, 2006.

F. Galand, Practical Construction Against Theoretical Approach in Fingerprinting. In Proceedings of the 2006 IEEE International Symposium on Information Theory, ISIT 06, Seattle, USA, july 2006.

G. Kabatiansky, C. Tavernier. List decoding of second order Reed-Muller codes, second part. . In Proceedings of Algebraic and Combinatorial Coding Theory, ACCT-10, pp. 131-135, Zvenigorod, Russia, September 2006.

I. de Lamberterie, M. Videau. Regards croisés de juristes et d'informaticiens sur la sécurité informatique, Actes du Symposium sur la Sécurité des Techologies de l'Information et des Communications, 2006, Article invité, A paraitre.

F. Levy-dit-Vehel, L. Perret. On Wagner-Magyarik cryptosystem . In Workshop on Coding and Cryptography - WCC 2005, number 3969 in Lecture Notes in Computer Science, pp. 316-29, Springer, 2006.

P. Loidreau. A Welch-Berlekamp like algorithm for decoding Gabidulin codes . In Workshop on Coding and Cryptography - WCC 2005, number 3969 in Lecture Notes in Computer Science, pp. 36-45, Springer, 2006.

P. Loidreau. How to reduce public-key size in McEliece-like public key cryptosystems, In CLC 2006, September 2006, Darmstadt, Germany. Invited talk.

P. Loidreau, R. Overbeck. Decoding rank errors beyond the error-correcting capacity. In Proceedings of Algebraic and Combinatorial Coding Theory, ACCT-10, Zvenigorod, Russia, September 2006.

M. Naya Plasencia. Cryptanalyse de systèmes de chiffrement à flot : étude de la sécurité d'Achterbahn. Rapport de stage de Master Recherche~II, Université de Versailles-St Quentin. Direction : N. A. Canteaut.

H. Ollivier, J.P. Tillich. Trellises for stabilizer codes : definition and uses. Phys. Rev. A, vol. 74, n. 3, September 2006.

N. Sendrier. Post-quantum code-based cryptography , In PQcrypto 2006, May 2006, Leuven, Belgium. Invited talk.

N. Sendrier. Key security of code-based public key cryptosystem, In CLC 2006, September 2006, Darmstadt, Germany. Invited talk.

N. Sendrier, C. Lauradoux. HAVEGE: true random number generator in software , In YACC 2006, June 2006, Porquerolles Island, France. Invited talk.

J.-P. Tillich and G. Zémor. On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation. In Proceedings of the 2006 IEEE International Symposium on Information Theory, ISIT 06, pp. 1549-53, Seattle, USA, july 2006.

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.

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.

2003

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.

2002

F. Arnault,T.P. Berger and A. Necer. Feedback with Carry Shift Registers synthesis with the Euclidean Algorithm. In Proceedings 2002 IEEE International Symposium on Information Theory, p. 69, Lausanne, Suisse, July 2002.

F. Arnault,T.P. Berger and A. Necer. A new class of stream ciphers combining LFSR and FCSR architectures. In Progress in Cryptology - INDOCRYPT 2002, number 2551 in LNCS, pages 22-33. Springer-Verlag, 2002.

D. Augot. A fast parallel version of Sudan's algorithm for the decoding of Reed-Solomon codes. In Proceedings 2002 IEEE International Symposium on Information Theory, p. 86, Lausanne, Suisse, July 2002.

T.P. Berger. Automorphism groups of homogeneous and projective Reed-Muller codes. IEEE Transactions on Information Theory, 48(5):1035--1045, 2002.

T.P. Berger. Isometries for rank distance and permutation group of Gabidulin codes. In Proceedings of ACCT'8, p. 30-33, St Petersbourg, Russia, November 2002.

T.P. Berger and P. Loidreau. Security of the Niederreiter form of the GPT public-key. In Proceedings 2002 IEEE International Symposium on Information Theory, p.267, Lausanne, Suisse, July 2002.

A. Canteaut. On the correlations between a combining function and functions of fewer variables. In Proceedings of 2002 IEEE Information Theory Workshop, pages 78-81, Bangalore, Inde, October 2002.

A. Canteaut and P. Charpin. Decomposing bent functions. In Proceedings 2002 IEEE International Symposium on Information Theory, Lausanne, Suisse, July 2002.

A. Canteaut and E. Filiol. On the influence of the filtering function on the performance of fast correlation attacks on filter generators. In Proceedings of 23rd Symposium on Information Theory in the Benelux, Louvain-la-Neuve, Belgique, May 2002.

A. Canteaut and M. Videau. Degree of composition of highly nonlinear functions and applications to higher order differential cryptanalysis. In Advances in Cryptology - EUROCRYPT 2002, Lecture Notes in Computer Science. Springer-Verlag, 2002.

A. Canteaut and M. Videau. Higher order differential attacks on iterated block ciphers using almost bent round functions. In Proceedings 2002 IEEE International Symposium on Information Theory, Lausanne, Suisse, July 2002.

A. Canteaut and M. Videau. Weakness of block ciphers using highly nonlinear confusion functions. Rapport de recherche RR-4367, INRIA, February 2002.

A. Canteaut, P. Charpin, and M. Videau. Cryptanalysis of block ciphers and weight divisibility of some binary codes. In Information, Coding and Mathematics (Workshop honoring Bob McEliece on his 60th birthday), p. 75-97, Kluwer, 2002.

A. Canteaut. Cryptanalyse de chiffrement à clef secrète par blocs. MISC - Le magazine de la sécurité informatique, (2), March 2002.

A. Canteaut. Le chiffrement à la volée. Pour la Science, pages 86-87, July 2002. Numéro spécial La cryptographie, l'art du secret.

C. Carlet and P. Sarkar. Spectral domain analysis of correlation immune and resilient Boolean functions. Finite fields and Applications, (8):120-130, 2002.

C. Carlet and Y. Tarannikov. Covering sequences of Boolean functions and their cryptographic significance. Designs Codes and Cryptography, 25:263-279, 2002.

C. Carlet. Upper bounds on the numbers of resilient functions and of bent functions. In Proceedings of 23rd Symposium on Information Theory in the Benelux, Louvain-la-Neuve, Belgique, May 2002, Werkgemeeschap voor Informatie- en Communicatietheorie, Enschede, The Nederlands, pp. 307-314.

C. Carlet. On cryptographic complexity of Boolean functions. In Finite fields: Theory, Applications and Algorithms (6th International conference on finite fields), LNCS, pp. 53-69, 2002. Invited paper - .

C. Carlet. A larger class of cryptographic Boolean functions via a study of the Maiorana-McFarland construction. In Advances in Cryptology - CRYPTO ~2002, Lecture Notes in Computer Science 2442, pages 549-564. Springer-Verlag, 2002.

C. Carlet. and A. Gouget. An upper bound on the number of m-resilient Boolean functions. In Advances in Cryptology - Asiacrypt 2002, Lecture Notes in Computer Science 2501, pages 484-496. Springer-Verlag, 2002.

P. Charpin and E. Pasalic. On propagation characteristics of resilient functions. In Selected Areas in Cryptography, SAC 2002, Lecture Notes in Computer Science 2595, pages 356--365. Springer-Verlag, 2002.

N. Courtois, M. Finiasz, and N. Sendrier. Short McEliece-based digital signatures. In Proceedings 2002 IEEE International Symposium on Information Theory, Lausanne, Suisse, July 2002.

É. Filiol. Applied cryptanalysis of cryptosystems and computer attacks through hidden ciphertexts computer viruses. Rapport de recherche RR-4359, INRIA, January 2002.

P. Loidreau. L'identification à divulgation nulle de connaissance. MISC - Le magazine de la sécurité informatique, 1, January 2002.

C. Nedeloaia. On weight distribution of cyclic self-dual codes. In Proceedings 2002 IEEE International Symposium on Information Theory, Lausanne, Suisse, July 2002.

H. Ollivier and W. H. Zurek. Quantum discord: A measure of the quantumness of correlations. Phys. Rev. Lett., 88(17901), 2002.

N. Sendrier. Cryptosystèmes à clé publique basés sur les codes correcteurs d'erreurs. Habilitation à diriger des recherches, Université Paris 6, March 2002.

N. Sendrier. On the security of the McEliece public-key cryptosystem. In Information, Coding and Mathematics (Workshop honoring Bob McEliece on his 60th birthday), p. 141--163, Kluwer, 2002.

C. Tavernier. Construction of modular curves and computation of their cardinality on F_p. In Finite fields: Theory, Applications and Algorithms (6th International conference on finite fields, Mai 2001, Oaxaca, Mexique), Springer, pp. 313-327, 2002.

J.-P. Tillich and G. Zémor. The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel. In Proceedings 2002 IEEE International Symposium on Information Theory, Lausanne, Suisse, July 2002.

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 Z₄ 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.

2000

D. Augot and L. Pecquet. A lifting method to replace factorization in Sudan's algorithm. IEEE Transactions on Information Theory, 46(7):2605-2614, November 2000.

T.P. Berger. Goppa and related codes invariant under a prescribed permutation. IEEE Transactions on Information Theory, 46(7):2628-2633, November 2000.

T.P. Berger. Groupes d'automorphismes des codes de Reed-Muller projectifs et homogènes. Comptes Rendus de l'Académie des Sciences, Série I, 331(11):935-938, 2000.

T.P. Berger. Quasi-cyclic Goppa codes. In Proceedings 2000 IEEE International Symposium on Information Theory, page 195, Sorrente, Italie, June 2000. IEEE.

T.P. Berger and P. Loidreau. A Niederreiter version of the GPT public-key cryptosystem. In International Workshop on Algebraic and Combinatorial Coding theory, ACCT-7, Bansko, Bulgarie, June 2000.

F. Blanchet and G. Bommier. Binary quasi-cyclic Goppa codes. Designs Codes and Cryptography, 20(2):107-124, June 2000.

A. Canteaut. La cryptographie. Techniques Avancées, 53, September 2000. Numéro spécial sur "La sécurité des systèmes d'information".

A. Canteaut and E. Filiol. Ciphertext only reconstruction of stream ciphers based on combination generators. In Fast Software Encryption 2000, number 1978 in LNCS, pages 165-180. Springer-Verlag, 2001.

A. Canteaut and M. Trabbia. Improved fast correlation attacks using parity-check equations of weight 4 and 5. In Advances in Cryptology - EUROCRYPT 2000, number 1807 in Lecture Notes in Computer Science, pages 573-588. Springer-Verlag, 2000.

A. Canteaut, C. Carlet, P. Charpin, and C. Fontaine. Propagation characteristics and correlation-immunity of highly nonlinear Boolean functions. In Advances in Cryptology - EUROCRYPT 2000, number 1807 in Lecture Notes in Computer Science, pages 507-522. Springer-Verlag, 2000.

A. Canteaut, P. Charpin, and H. Dobbertin. Weight divisibility of cyclic codes, highly nonlinear functions on GF(2^m) and crosscorrelation of maximum-length sequences. SIAM Journal on Discrete Mathematics, 13(1), 2000.

A. Canteaut, P. Charpin, and H. Dobbertin. Binary m-sequences with three-valued crosscorrelation: A proof of Welch conjecture. IEEE Transactions on Information Theory, 46(1):4-8, 2000.

C. Carlet. On the divisibility properties and nonlinearity of resilient functions. Comptes Rendus de l'Académie des Sciences de Paris, Série I, 331(11):917-922, 2000.

E. Filiol. Reconstruction of punctured convolutional encoders. In International Symposium on Information Theory and its Applications (ISITA'00), Hawaii, November 2000.

É. Filiol. Decimation attack of stream ciphers. In Proceedings of the First International Conference - INDOCRYPT'2000, number 1977 in LNCS, pages 31-42. Springer-Verlag, December 2000.

C. Fontaine. Tatouage des images numériques et protection des droits d'auteur. Pour la Science, 270:102-106, April 2000.

E.M. Gabidulin and P. Loidreau. Subfield subcodes of maximum-rank distance codes. In International Workshop on Algebraic and Combinatorial Coding theory, ACCT-7, pages 151-156, Bansko, Bulgarie, June 2000.

P. Loidreau. Large weight patterns decoding in Goppa codes and application to cryptography. In Proceedings 2000 IEEE International Symposium on Information Theory, page 186, Sorrente, Italie, June 2000. IEEE.

P. Loidreau. Strengthening McEliece public-key cryptosystem. In Advances in Cryptology - ASIACRYPT 2000, number 1976 in LNCS, pages 585-598. Springer-Verlag, December 2000.

N. Sendrier. Finding the permutation between equivalent codes: the support splitting algorithm. IEEE Transactions on Information Theory, 46(4):1193-1203, July 2000. Regular paper.

A. Valembois. Décodage, détection et reconnaissance des codes linéaires binaires. Thèse de doctorat, Université de Limoges, October 2000.

1999

D. Augot, J.-M. Boucqueau, J.-F. Delaigle, C. Fontaine, and E. Goray. Secure delivery of images over open networks. Proceedings of the IEEE, 87(7):1251-1266, July 1999. Special Issue on Identification and protection of multimedia information (invited paper).

T.P. Berger and P. Charpin. The automorphism group of BCH codes and of some affine-invariant codes on an extension field. Designs, Codes and Cryptography, 18(1/3):29-53, 1999.

T.P. Berger. New classes of cyclic extended Goppa codes . IEEE Transactions on Information Theory, 45(4):1264-1266, 1999.

T.P. Berger. On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes and extended Goppa codes. Finite Fields and their Applications, 6:255-281, 2000.

T.P. Berger. Cyclic alternant codes induced by an automorphism of a GRS code . In R. Mullin and G. Mullen, editors, Finite Fields and their Applications 1997, number 225 in Contemporary Mathematics, pages 143-154. AMS, 1999.

P. Camion and A. Canteaut. Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography . Designs, Codes and Cryptography, (16):121-149, 1999.

A. Canteaut, P. Charpin, and H. Dobbertin. A new characterization of almost bent functions . In L. Knudsen, editor, Fast Software Encryption 99, number 1636 in Lecture Notes in Computer Science, pages 186-200. Springer-Verlag, 1999.

A. Canteaut, P. Charpin, and H. Dobbertin. Couples de suites binaires de longueur maximale ayant une corrélation croisée à trois valeurs : conjecture de Welch . C.R. Acad. Sci. Paris, t. 328, Série I:173-178, 1999.

C. Carlet and P. Guillot. A representation of Boolean functions. In Applied Algebra, Algebraic Algorithms and Error Correcting Codes - AAECC'13, number 1719 in LNCS, pages 94-103. Springer-Verlag, November 1999.

C. Carlet. One-weight Z₄-linear codes . In International conference on Coding Theory, Cryptography and Related Areas 1998, Lecture Notes in Computer Science. Springer Verlag, 1999. to appear.

C. Carlet. On cryptographic propagation criteria for Boolean functions . Information and Computation, (151):32-56, 1999. Special Issue on Cryptology in Honor of Professor Arto Salomaa on Occasion of His 65th Birthday (invited paper).

C. Carlet. On Kerdock codes . In R. Mullin and G. Mullen, editors, Finite Fields and their Applications 1997, number 225 in Contemporary Mathematics, pages 155-163. American Mathematical Society, 1999.

C. Carlet. Recent results on bent functions. In Proceedings on International Conference on Combinatorics, Information Theory and Statistics, volume 24 of Journal of Combinatorics, Information & System Sciences, pages 275-291, 1999.

P. Charpin, A. Tietavainen, and V. Zinoviev. On the minimum distances of non-binary cyclic codes. Designs, Codes and Cryptography, 17(1/3):81-85, 1999.

E. Filiol. Designs, intersecting families and weight of Boolean functions. In 7th IMA Conference on Cryptography and Coding, number 1746 in Lecture Notes in Computer Science, pages 70-81. Springer Verlag, 1999.

C. Fontaine. On some cosets of the first-order Reed-Muller code with high minimum weight. IEEE Transactions on Information Theory, 45(4):1237-1243, May 1999.

P. Loidreau. On the factorization of trinomials over GF(3). In Fifth International Conference on Finite Fields and Applications, Augsburg, Germany, 1999.

P. Loidreau. Codes dérivés de certains codes de Goppa. In Journée ATI, Marseille, France, 1999.

L. Pecquet. An algorithm to get some factors of bivariate polynomials without factoring . In Fifth International Conference on Finite Fields and Applications, Augsburg, Allemagne, 1999.

N. Sendrier and G. Skersys. Permutation groups of error-correcting codes. In Workshop on Coding and Cryptography - (WCC'99), 10-14 janvier, Paris, France, January 1999.

N. Sendrier. The support Splitting Algorithm.> Rapport de recherche RR-3637, INRIA, March 1999.

1998

D. Augot, C. Fontaine, and J.-F. Delaigle. Dhwm: A scheme for managing watermarking keys in the aquarelle multimedia distributed system. In Computer Security - ESORICS 98, number 1485 in Lecture Notes in Computer Science, pages 241-255. Springer Verlag, 1998.

D. Augot and C. Fontaine. Key issues for watermarking digital images. In Proceedings of SPIE, EUROPTO - Conference on Electronic Imaging: Processing, Printing, and Publishing in Color, volume 3409 of EUROPTO, pages 176-185, Zürich, Switzerland, mai 1998.

D. Augot and L. Pecquet. An alternative to factorization: a speedup for Sudan's decoding algorithm and its generalization to algebraic-geometric codes. Research Report RR-3532, INRIA, 1998.

T.P. Berger. Goppa codes with a cyclic parity-check subcode or a cyclic extension. In International Workshop on Algebraic and combinatorial coding theory, ACCT-VI, pages 22-25, Pskov, Russia, 1998.

A. Canteaut and N. Sendrier. Cryptanalysis of the original McEliece cryptosystem . In Advances in Cryptology - ASIACRYPT'98, number 1514 in Lecture Notes in Computer Science, pages 187-199. Springer-Verlag, 1998.

A. Canteaut. On the hypothesis of stochastic equivalence for Feistel ciphers . In IEEE International Symposium on Information Theory, ISIT'98, page 81, Boston, USA, 1998.

A. Canteaut and F. Chabaud. A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511. . IEEE Transactions on Information Theory, 44(1):367-378, january 1998.

C. Carlet, P. Charpin, and V. Zinoviev. Codes, bent functions and permutations suitable for DES-like cryptosystems . Designs, Codes and Cryptography, (15):125-156, 1998.

C. Carlet and P. Guillot. An alternate characterization of the bentness of binary functions, with uniqueness . Designs, Codes and Cryptography, 14(2):133-140, 1998.

C. Carlet. Z_2^k-linear codes . IEEE Transactions on Information Theory, 44(4):1543-1547, 1998.

C. Carlet. On the propagation criterion of degree 1 and order k . In Advances in Cryptology - EUROCRYPT'98, number 1403 in Lecture Notes in Computer Science, pages 462-474. Springer-Verlag, 1998.

C. Carlet. One-weight Z₄-linear codes. In International Conference on Coding theory, Cryptography and related areas, Guanajuato, Mexique, avril 1998.

C. Carlet. Z_2^k-linear codes. In IEEE International Symposium on Information Theory, ISIT'98, page 150, Boston, USA, 1998.

P. Charpin. Open problems on cyclic codes, in "Handbook of Coding Theory", volume I, chapter 11, pages 963-1063, V.S. Pless, C.W. Huffman, editors, R.A. Brualdi, assistant editor. Elsevier, 1998.

E. Filiol and C. Fontaine. Highly nonlinear balanced Boolean functions with a good correlation-immunity . In Advances in Cryptology - EUROCRYPT'98, number 1403 in Lecture Notes in Computer Science, pages 475-488. Springer Verlag, 1998.

C. Fontaine. A method to find cosets of the first-order Reed-Muller code with a high minimum weight. In IEEE International Symposium on Information Theory, ISIT'98, page 464, Boston, USA, 1998.

C. Fontaine. Contribution à la recherche de fonctions booléennes hautement non linéaires, et au marquage d'images en vue de la protection des droits d'auteur. Thèse de doctorat, Université Paris 6, novembre 1998.

P. Loidreau and N. Sendrier. Some weak keys in McEliece public-key cryptosystem. In IEEE International Symposium on Information Theory, ISIT'98, page 382, Boston, USA, 1998.

P. Loidreau. On codes derived from Goppa codes. In International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-VI, Pskov, Russia, 1998.

L. Pecquet. On the tau-reconstruction of Reed-Solomon codes using affine plane curves. In International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-VI, Pskov, Russia, 1998.

N. Sendrier. On the concatenated structure of a linear code. AAECC, 9(3):221-242, 1998.

1997

A. Canteaut. Differential cryptanalysis of Feistel ciphers and differentially uniform mappings . In Selected Areas on Cryptography, SAC'97, pages 172-184, Ottawa, Canada, 1997.

A. Canteaut and F. Chabaud. A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to BCH codes of length 511 . In IEEE International Symposium on Information Theory, ISIT'97, page 327, Ulm, Germany, 1997.

C. Carlet and P. Guillot. A characterization of binary bent functions . In IEEE International Symposium on Information Theory, ISIT'97, page 451, Ulm, Germany, 1997.

C. Carlet. More correlation-immune and resilient functions over Galois fields and Galois rings . In Advances in Cryptology - EUROCRYPT'97, number 1233 in Lecture Notes in Computer Science, pages 422-433. Springer-Verlag, 1997.

C. Carlet, P. Charpin, and V. Zinoviev. Uniformly packed codes, bent functions and their involment in DES-like cryptosystems. In Third Mediterranean Workshop on Coding and Information Integrity, Ein Boqeq, Israël, 1997.

C. Carlet, P. Charpin, and V. Zinoviev. Cyclic codes and permutations suitable for DES-like cryptosystems. In IEEE Information Theory Workshop, Longyearbyen, Norway, 1997.

C. Carlet and P. Guillot. Codes Z_2^k-linéaires. C.R. Acad. Sci. Paris, t.325:111-116, 1997.

P. Charpin, A. Tietavainen, and V. Zinoviev. On binary cyclic codes whose minimum distance is 3. Problems of Information Transmission, 33(3):3-14, 1997.

P. Charpin, A. Tietavainen, and V. Zinoviev. On the minimum distance of certain cyclic codes. In IEEE International Symposium on Information Theory, ISIT'97, page 505, Ulm, Germany, 1997.

P. Charpin and V. Zinoviev. On coset weight distributions of the 3-error-correcting BCH-codes. SIAM Journal of Discrete Mathematics, 10(1):128-145, 1997.

E. Filiol. Reconstruction of convolutional encoders over GF(q) . In Cryptography and Coding - Sixth IMA Conference, number 1355 in Lecture Notes in Computer Science, pages 101-109. Springer Verlag, 1997.

E. Filiol. Reconstruction de codeurs convolutifs . Rapport de DEA, Ecole Polytechnique, 1997.

P. Loidreau. Eléments sur les codes de Goppa en relation avec le protocole de McEliece. Rapport de DEA, Ecole Polytechnique, 1997.

L. Pecquet. Codes correcteurs d'erreurs et systèmes algébriques. Rapport de DEA, Université Joseph Fourier, Grenoble I, 1997.

N. Sendrier. On the dimension of the hull. SIAM Journal on Applied Mathematics, 10(2):282-293, May 1997.

1996

T. Berger and P. Charpin. The permutation group of affine-invariant extended cyclic codes. IEEE Transactions on Information Theory, 42(6):2194-2209, 1996.

T. Berger. On the automorphism groups of affine-invariant codes. Designs, Codes and Cryptography, (7):215-221, 1996.

T. Berger. Groupes d'automorphismes et de permutations des codes affine-invariants. Habilitation à diriger des recherches, Université Limoges, janvier 1996.

T. Berger and P. Charpin. Permutation group of some affine-invariant codes over extension fields. In D. Yorgov, editor, International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-5, pages 27-32, Sozopol, Bulgaria, 1996. Unicorn Co. Shumen.

T. Berger. The automorphism group and the permutation group of affine-invariant codes. In S. Cohen and H. Niederreiter, editors, Finite Fields and their Applications, number 233 in Lecture Note, London Math. Society, pages 32-45, 1996.

P. Camion and A. Canteaut. Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations . In N. Koblitz, editor, Advances in Cryptology - CRYPTO'96, number 1109 in Lecture Notes in Computer Science, pages 372-386. Springer-Verlag, 1996.

P. Camion and A. Canteaut. Construction of t-resilient functions over a finite alphabet . In U. Maurer, editor, Advances in Cryptology - EUROCRYPT'96, number 1070 in Lecture Notes in Computer Science, pages 283-293. Springer-Verlag, 1996. Also appeared as Research Report RR-2789, INRIA, 1996.

A. Canteaut. Attaques de cryptosystèmes à mots de poids faible et construction de fonctions t-résilientes . PhD thesis, Université Paris 6, October 1996.

Claude Carlet. Hyperbent functions . In Proceedings of Pragocrypt'96, pages 145-155, Prague, 1996. Czech Technical University Publishing House.

Claude Carlet. A construction of bent functions . In Finite Fields and their Applications, number 233 in Lecture Series, London Math. Society, 1996.

C. Carlet. A characterization of binary bent functions . In Fifth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-5), Sozopol, Bulgarie, 1-7 juin 1996.

C. Carlet. Hyper-bent functions . In Mediterranean Workshop on Coding and Information Integrity, Palma-de-Majorque, Spain, 1996.

C. Carlet and P. Guillot. A characterization of binary bent functions . Journal of Combinatorial Theory, Series A, 76(2):328-335, 1996.

P. Charpin, A. Tietavainen, and V. Zinoviev. On binary cyclic codes with minimum distance three. In D. Yorgov, editor, International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-5, Sozopol, Bulgaria, 1996. Unicorn Co. Shumen.

P. Charpin. Self-dual codes which are principal ideals of the group algebra F₂ . The Journal of Statistical Planning and Inference, 56:79-92, 1996.

C. Fontaine. The nonlinearity of a class of boolean functions with short representation. In Proceedings of Pragocrypt'96, pages 129-144, 1996.

1995

T. Berger and P. Charpin. Groupe de permutations des codes affine-invariants. C.R. Acad. Sci. Paris, t.321, Série I:1383-1387, 1995.

T. Berger and P. Charpin. Permutation group of affine-invariant codes. In Special Session of the AMS on Codes and their applications, Chicago, Illinois, 1995.

T. Berger. Classification of finite groups and affine-invariant codes. In Special Session of the AMS on Codes and their applications, Chicago, Illinois, 1995.

T. Berger and P. Charpin. Permutation group of affine-invariant codes. In IEEE International Symposium on Information Theory, ISIT'95, Whistler, Canada, 1995.

A. Canteaut. A new algorithm for finding minimum-weight words in large linear codes . In C. Boyd, editor, Cryptography and Coding - 5th IMA Conference, number 1025 in Lecture Notes in Computer Science, pages 205-212. Springer-Verlag, 1995.

A. Canteaut and F. Chabaud. Improvements of the attacks on cryptosystems based on error-correcting codes . Technical Report LIENS-95-21, Ecole Normale Supérieure, July 1995.

C. Carlet. Generalized partial spreads . IEEE Transactions on Information Theory, 41(5):1482-1487, 1995.

C. Carlet. On Z₄-duality . IEEE Transactions on Information Theory, 41(5):1487-1495, 1995.

C. Carlet and P. Guillot. Une caractérisation des fonctions courbes. C.R. Acad. Sci. Paris, 1995.