Team Codes
Members
Overall Objectives
Scientific Foundations
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography
previous up next PDF XML

Bibliography

Publications of the year

Books and Monographs

[1]
E. Filiol.
Computer viruses: from theory to applications, IRIS International series, Springer Verlag, june 2005, vol. ISBN 2-287-23939-1.
[2]
G. Kabatiansky, E. Krouk, S. Semenov.
Error Correcting Codes and Security for Data Networks, 278 pages, John Willey & Sons Ltd, 2005, vol. ISBN 0-470-86754-X.

Doctoral dissertations and Habilitation theses

[3]
C. S. Nedeloaia.
Etude 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.
[4]
L. Perret.
Etude d'outils algébriques et combinatoires pour la cryptographie à clef publique, Thèse de doctorat, Université de Marne-la-Vallée, Octobre 2005.
[5]
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), Novembre 2005.

Articles in refereed journals and book chapters

[6]
F. Arnault, T. Berger.
Design and properties of a new pseudo-random generator based on a filtered FCSR automaton, in: IEEE, Transactions on Computers, to appear, 2005.
[7]
T. Berger, A. Canteaut, P. Charpin, Y. Laigle-Chapuy.
On Almost Perfect Nonlinear functions, in: IEEE Trans. Inform. Theory, To appear, 2005.
[8]
T. Berger, P. Loidreau.
How to mask the structure of codes for a cryptographic use, in: Designs, Codes and Cryptography, april 2005, vol. 35, p. 63-79.
[9]
R. Bhaskar, D. Augot, V. Issarny, D. Sacchetti.
A Three Round Authenticated Group Key Agreement Protocol for Ad hoc Networks, in: Elsevier Journal on Pervasive and Mobile Computing, To appear, 2005.
[10]
A. Canteaut, C. Carlet, H. Dobbertin, P. Felke, P. Gaborit, G. Leander.
Construction of bent functions via Niho power functions, in: Journal of Combinatorial Theory, 2005.
[11]
A. Canteaut, M. Videau.
Symmetric Boolean functions, in: IEEE Trans. Inform. Theory, Regular Paper, 2005, vol. 51, no 8, p. 2791–2811.
[12]
C. Carlet.
Concatenating indicators of flats for designing cryptographic functions, in: Designs, Codes and Cryptography, 2005, vol. 36, p. 189-202.
[13]
C. Carlet.
The Weight Distribution of a Class of Linear Codes from Perfect Nonlinear Functions, in: IEEE Trans. Inform. Theory, to appear, 2005.
[14]
C. Carlet, P. Charpin.
Cubic Boolean functions with highest resiliency, in: IEEE Trans. Inform. Theory, Regular paper, February 2005, vol. 51, no 2, p. 562-571.
[15]
C. Carlet, C. Ding.
Nonlinearities of S-boxes, in: Finite Fields and Their Applications, to appear, 2005.
[16]
C. Carlet, C. Ding, H. Niederreiter.
Authentication Schemes from Highly Nonlinear Functions, in: Designs, Codes and Cryptography, to appear, 2005.
[17]
C. Carlet, C. Ding, J. Yuan.
Linear Codes from Perfect Nonlinear Mappings and their Secret Sharing Schemes, in: IEEE Trans. Inform. Theory, to appear, 2005.
[18]
C. Carlet, P. Gaborit.
Hyper-bent functions and cyclic codes, in: ournal of Combinatorial Theory, to appear, 2005.
[19]
C. Carlet, J. Yucas.
Piecewise Constructions of Bent and Almost Optimal Boolean Functions, in: Designs, Codes and Cryptography, to appear, 2005.
[20]
P. Charpin, T. Helleseth, V. Zinoviev.
On cosets of weight 4 of binary BCH codes of length 2 m ( modd), with minimal distance 8, and exponential sums, in: Problems of Information Transmission, 2005, vol. 41, no 4, p. 331-348.
[21]
P. Charpin, T. Helleseth, V. Zinoviev.
Propagation characteristics of Im2 ${x\#8614 1/x}$ and Kloosterman sums, in: Finite Fields and Applications, to appear, 2005.
[22]
P. Charpin, T. Helleseth, V. Zinoviev.
The Coset Distribution of the Triple-Error-Correcting Binary Primitive BCH Codes, in: IEEE Trans. Inform. Theory, to appear, 2005.
[23]
P. Charpin, E. Pasalic.
Highly nonlinear resilient functions through disjoint codes in projective spaces, in: Designs Codes and Cryptography, 2005, vol. 37, p. 319-346.
[24]
P. Charpin, E. Pasalic, C. Tavernier.
On bent and semi-bent quadratic Boolean functions, in: IEEE Trans. Inform. Theory, Regular paper, to appear, 2005.
[25]
F. Didier.
A new bound on the block error probability after decoding over the erasure channel, in: IEEE Trans. Inform. Theory, to appear, 2006.
[26]
E. Filiol.
Cryptologie malicieuse ou virologie cryptologique ?, in: MISC - Le journal de la sécurité informatique, juillet 2005, vol. 20.
[27]
E. Filiol.
Evaluation des logiciels antiviraux : quand le marketing s'opposeà la technique, in: MISC - Le journal de la sécurité informatique, septembre 2005, vol. 21.
[28]
E. Filiol.
La simulabilité des tests statistiques, in: MISC - Le journal de la sécurité informatique, novembre 2005, vol. 22.
[29]
E. Filiol.
Le virus Bradley ou l'art du blindage total, in: MISC - Le journal de la sécurité informatique, juillet 2005, vol. 20.
[30]
E. Filiol.
Le virus Ymun : la cryptanalyse sans peine, in: MISC - Le journal de la sécurité informatique, juillet 2005, vol. 20.
[31]
E. Filiol.
Le virus perrun : méfiez vous des images... et des rumeurs, in: MISC - Le journal de la sécurité informatique, mars 2005, vol. 18.
[32]
E. Filiol.
Le virus whale : le virus se rebiffe, in: MISC - Le journal de la sécurité informatique, mai 2005, vol. 19.
[33]
E. Filiol.
SCOB/PADODOR : quand les codes malveillants collaborent, in: MISC - Le journal de la sécurité informatique, January 2005, vol. 17.
[34]
J. Friedman, R. Murty, J. Tillich.
Spectral estimates for Abelian Cayley graphs, in: Journal of Combinatorial Theory Ser.B, in Press, 2005.
[35]
J. Friedman, J. Tillich.
Generalized Alon-Boppana Theorems and Error-Correcting Codes, in: SIAM Journal of Discrete Mathematics, in Press, 2005.
[36]
P. Gaborit, C. S. Nedeloaia, A. Wassermann.
Weight enumerators of duadic and quadratic residue codes, in: IEEE Trans. Inf. Theory, January 2005, vol. 51, no 1, p. 402-407.
[37]
G. Kabatiansky.
Codes for copyright protection:the case of two pirates, in: Information Transmission Problems, 2005, vol. 41, no 2, p. 123-127.
[38]
Y. Laigle-Chapuy.
Permutation Polynomials and applications to coding theory, in: Finite Fields and Applications, To appear, 2005.
[39]
C. Lauradoux.
Machine virtuelle et Honeypot, in: MISC - Le journal de la sécurité informatique, version allemande dans Multi-System, Internet, Security & Cookbook, n. 1, Septembre 2005, vol. 21.
[40]
C. Lauradoux.
Timing Attack et Hyperthreading, in: MISC - Le journal de la sécurité informatique, version allemande dans Multi-System, Internet, Security & Cookbook, n. 1, Septembre 2005, Juillet 2005, vol. 20.
[41]
P. Loidreau.
Pour quelques bits d'information, in: MISC - Le magazine de la sécurité informatique, Juillet-Août 2005, no 20.

Publications in Conferences and Workshops

[42]
I. Andriyanova, J.-P. Tillich, J.-C. Carlach.
Asymptotically Good Codes with High Iterative Decoding Performances, in: Proceedings 2005 IEEE International Symposium on Information Theory, Adelaide, Australie, September 2005, p. 850-854.
[43]
I. Andriyanova, J.-P. Tillich, J.-C. Carlach.
A new family of codes with high iterative decoding performances, in: Proceedings of ICC2006, Istambul, Turquie, to appear, June 2006.
[44]
F. Arnault, T. Berger.
F – FCSR: Design of a new class of stream ciphers, in: Fast Software Encryption, FSE 2005, Lecture Notes in Computer Science, Springer-Verlag, 2005, no 3557, p. 83-97.
[45]
F. Arnault, T. Berger, C. Lauradoux.
Description of F-FCSR-8 and F-FCSR-H stream ciphers, in: SKEW - Symmetric Key Encryption Workshop, Aarhus, Danemark, An ECRYPT STVL event, May 2005.
[46]
D. Augot, M. Bardet, J. Faugère.
Decoding cyclic codes with algebraic systems, in: Joint BeNeLuxFra Conference in Mathematics, Gand, Belgique, May 2005.
[47]
D. Augot, M. Finiasz, N. Sendrier.
A Family of Fast Syndrome Based Cryptographic Hash Function, in: Ecrypt Conference on Hash Functions, Krakow, Poland, June 2005.
[48]
D. Augot, M. Finiasz, N. Sendrier.
A Family of Fast Syndrome Based Cryptographic Hash Functions, in: Progress in Cryptology - Mycrypt 2005, E. Dawson, S. Vaudenay (editors), LNCS, Springer-Verlag, 2005, no 3715, p. 64-83.
[49]
C. Berbain, O. Billet, A. Canteaut, N. Courtois, B. Debraize, H. Gilbert, L. Goubin, A. Gouget, L. Granboulan, C. Lauradoux, M. Minier, T. Pornin, H. Sibert.
Decim : a new stream cipher for hardware applications, in: Proceedings of SKEW - Symmetric Key Encryption Workshop, Network of Excellence in Cryptology ECRYPT, Soumis au projet européen eSTREAM, en réponse à Call for Stream Cipher Primitives, Network of Excellence in Cryptology ECRYPT, May 2005
http://www.ecrypt.eu.org/stream/.
[50]
C. Berbain, O. Billet, A. Canteaut, N. Courtois, H. Gilbert, L. Goubin, A. Gouget, L. Granboulan, C. Lauradoux, M. Minier, T. Pornin, H. Sibert.
Sosemanuk : a fast oriented software-oriented stream cipher, in: Proceedings of SKEW - Symmetric Key Encryption Workshop, Network of Excellence in Cryptology ECRYPT, Soumis au projet européen eSTREAM, en réponse à Call for Stream Cipher Primitives, Network of Excellence in Cryptology ECRYPT, May 2005
http://www.ecrypt.eu.org/stream/.
[51]
T. Berger, A. Canteaut, P. Charpin, Y. Laigle-Chapuy.
On Almost Perfect Nonlinear mappings, in: Proceedings 2005 IEEE International Symposium on Information Theory, Adelaide, Australie, to appear, September 2005.
[52]
T. Berger, M. Minier.
Two algebraic attacks against the F-FCSRs using the IV mode, in: Advances in Cryptology - INDOCRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, 2005, no 3797, p. 143-154.
[53]
R. Bhaskar, D. Augot, V. Issarny, D. Sacchetti.
An Efficient Group Key Agreement Protocol for Ad hoc Networks, in: IEEE Workshop on Trust, Security and Privacy in Ubiquitous Computing, Taormina, Italy, June 2005.
[54]
L. Budaghyan, C. Carlet, 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), March 2005, p. 306-315.
[55]
T. Camara, H. Ollivier, J. Tillich.
Constructions of quantum LDPC codes, in: proceedings of EQUIS2005, ERATO conference on quantum information science, September 2005, p. 65-66.
[56]
A. Canteaut.
Fast Correlation Attacks Against Stream Ciphers and Related Open Problems, in: Proceedings of the 2005 IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security (ITW 2005), Awaji Island, Japon, Invited talk, IEEE Press, octobre 2005.
[57]
A. Canteaut.
Le chiffrement à flot, in: Ecole de Jeunes Chercheurs en Algorithmique et Calcul Formel 2005, Montpellier, avril 2005.
[58]
A. Canteaut.
Open problems related to algebraic attacks on stream ciphers, in: Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), invited talk, March 2005, p. 1-11.
[59]
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, Adelaide, Australie, September 2005.
[60]
C. Carlet.
On bent and highly nonlinear balanced/resilient functions and their algebraic immunities, in: actes du congrès AAECC 16, article invité, 2005.
[61]
C. Carlet.
On highly nonlinear S-boxes and their inability to thwart DPA attack, in: Advances in Cryptology - INDOCRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, 2005, no 3797, p. 49-62.
[62]
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, Adelaide, Australie, September 2005.
[63]
C. Carlet, S. Gangopadhyay, S. Maitra.
Crosscorrelation spectra of Dillon type functions, in: actes du congrès International Workshop on Sequence Design and its Applications in Communications - IWSDA'05, 2005.
[64]
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, Adelaide, Australie, September 2005.
[65]
P. Charpin, T. Helleseth, V. Zinoviev.
The Coset Distribution of the Triple-Error-Correcting Binary Primitive BCH Codes, in: Proceedings 2005 IEEE International Symposium on Information Theory, Adelaide, Australie, to appear, September 2005.
[66]
M. Cluzeau.
Reconstruction d'un brasseur linéaire, in: Ecole de Jeunes Chercheurs en Algorithmique et Calcul Formel, Montpellier, France, Avril 2005.
[67]
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), March 2005, p. 275-85.
[68]
E. Filiol.
Strong Cryptography Armoured Computer Viruses Forbidding Code Analysis: the bradley virus, in: Proceedings of the 14th EICAR Conference, 2005, p. 201-217.
[69]
E. Gabidulin, P. Loidreau.
On subcodes of codes in rank metric, in: Proceedings 2005 IEEE International Symposium on Information Theory, Adelaide, Australie, to appear, September 2005.
[70]
P. Gaborit.
Shorter keys for code based cryptography, in: Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), March 2005, p. 81-91.
[71]
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.
[72]
C. Lauradoux.
Collision attacks on processors with cache and countermeasures., in: WeWork 2005, Western European Workshop on Research in Cryptology, Leuven, Belgium, July 2005.
[73]
C. Lauradoux.
Complexité des fonctions booléennes symétriques, in: Ecole de Jeunes Chercheurs en Algorithmique et Calcul Formel, Montpellier, France, Avril 2005.
[74]
C. Lauradoux.
Machine Virtuelle et Pot de miel, in: Ecole Internet Nouvelle Génération, ING 2005, Montreuil sur Mer, France, Juillet 2005.
[75]
F. Levy-dit-Vehel, l. Perret.
On Wagner-Magyarik Cryptosystem, in: Proceedings of WCC'2005, Bergen, Norway, 2005, p. 285-294.
[76]
P. Loidreau.
A Welch-Berlekamp like algorithm for decoding Gabidulin codes, in: Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), March 2005, p. 30-39.
[77]
M. Minier.
An Integral Cryptanalysis of a five rounds version of FOX., in: WeWork 2005, Western European Workshop on Research in Cryptology, Leuven, Belgium, July 2005.
[78]
H. Ollivier, J.-P. Tillich.
Interleaved serial concatenation of quantum convolutional codes: gate implementation and iterative error estimation algorithm, in: actes du 26th Symposium on Information Theory in the Benelux, Bruxelles, Belgique, 2005, 149 p.
[79]
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), March 2005, p. 235-45.
[80]
L. Perret.
A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem, in: Advances in Cryptology - EUROCRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, 2005, no 3494, p. 354-71.
[81]
L. Perret.
Algorithms for solving the isomorphism of polynomials with one secret problem, in: Joint BeNeLuxFra Conference in Mathematics, Gand, Belgique, Joint Meeting Of The Belgian (BMS), Dutch (KWG), Luxembourg And French (SMF) Mathematical Societies, May 2005.
[82]
N. Sendrier.
Encoding information into constant weight words, in: Proceedings 2005 IEEE International Symposium on Information Theory, Adelaide, Australie, September 2005.
[83]
N. Sendrier.
Public-key cryptology based on error-correcting codes, in: CAEN'05, Invited talk, June 2005.
[84]
V. V. Shorin, P. Loidreau.
Application of Groebner bases Techniques for searching new sequences with good periodic correlation properties, in: Proceedings of 2005 International Symposium on Information Theory, ISIT 2005, September 2005.
[85]
M. Videau.
Symmetric Boolean functions with high nonlinearity, in: WeWork 2005, Western European Workshop on Research in Cryptology, Leuven, Belgium, July 2005.

Internal Reports

[86]
D. Augot, M. Finiasz, N. Sendrier.
A Family of Fast Syndrome Based Cryptographic Hash Function, Rapport de Recherche, INRIA, June 2005, no 5592
http://www.inria.fr/rrrt/rr-5592.html.
[87]
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, Technical report, ACI SERAC, 2005.
[88]
T. Berger, A. Canteaut, P. Charpin, Y. Laigle-Chapuy.
Almost perfect nonlinear functions, Technical report, Rapport de Recherche INRIA, Décembre 2005, no RR-5774
http://www.inria.fr/rrrt/rr-5774.html.
[89]
P. Loidreau.
An Algebraic attack against Augot-Finiasz cryptosystem, Technical report, INRIA, 2005, no RR-5662
http://www.inria.fr/rrrt/rr-5662.html.
[90]
C. S. Nedeloaia.
Upper bounds on the dual distances of EBCH codes, Technical report, Rapport de Recherche INRIA, Janvier 2005, no RR-5477
http://www.inria.fr/rrrt/rr-5477.html.

Miscellaneous

[91]
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.
A. Canteaut (editor), Open Research Areas in Symmetric Cryptography and Technical Trends in Lightweight Cryptography, 2005
http://www.ecrypt.eu.org/documents/D.STVL.3-2.5.pdf, Rapport du réseau d'excellence européen ECRYPT.
[92]
F. Didier, J. P. Tillich.
Computing the algebraic immunity efficiently, 2006.
[93]
P. Gaborit.
Clés plus courtes pour les cryptosystèmes de chiffrement basés sur des codes, Journées "Codage et Cryptographie", Aussois, France, Février 2005.
[94]
Y. Laigle-Chapuy.
Polynômes de permutation et application en théorie des codes, Journées "Codage et Cryptographie", Aussois, France, Février 2005.
[95]
M. Minier.
LILI-128 et ses attaques, Journées "Codage et Cryptographie", Aussois, France, Février 2005.

previous
next