Team Secret

Members
Overall Objectives
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
D. Augot, M. Finiasz.
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem, in: Advances in Cryptology - EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, 2003, no 2656, p. 229-240.
[2]
A. Canteaut, M. Trabbia.
Improved fast correlation attacks using parity-check equations of weight 4 and 5, in: Advances in Cryptology - EUROCRYPT 2000, LNCS, Springer Verlag, 2000, no 1807, p. 573–588.
[3]
A. Canteaut, M. Videau.
Symmetric Boolean functions, in: IEEE Transactions on Information Theory, 2005, vol. 51, no 8, p. 2791–2811.
[4]
P. Charpin.
Cyclic codes with few weights and Niho exponents, in: Journal of Combinatorial Theory, Series A, November 2004, vol. 108, no 2, p. 247-259.
[5]
P. Charpin, T. Helleseth, V. Zinoviev.
The Coset Distribution of the Triple-Error-Correcting Binary Primitive BCH Codes, in: IEEE Transactions on Information Theory, 2006, vol. 52, no 4, p. 1727-1732.
[6]
N. Courtois, M. Finiasz, N. Sendrier.
How to achieve a McEliece-based Digital Signature Scheme, in: Advances in Cryptology - Asiacrypt 2001, LNCS, Springer-Verlag, 2001, no 2248, p. 157–174.
[7]
F. Didier, J.-P. Tillich.
Computing the algebraic immunity efficiently, in: Fast Software Encryption - FSE 2006, LNCS, Springer, 2006, vol. 4047, p. 359-374.
[8]
J. Friedman, J.-P. Tillich.
Generalized Alon-Boppana Theorems and Error-Correcting Codes, in: SIAM Journal of Discrete Mathematics, 2005, vol. 19, no 3, p. 700-718.
[9]
H. Ollivier, J.-P. Tillich.
Description of a quantum convolutional code, in: Phys. Rev. Lett., quant-ph 0304189, 2003, vol. 91, no 17
http://www.arxiv.org/abs/quant-ph/0304189.
[10]
A. Seznec, N. Sendrier.
HAVEGE: User-level Software Heuristic for Strong Random Numbers, in: ACM Transactions on Modeling and Computer Simulation, October 2003, vol. 14, no 4, p. 334-346.

Publications of the year

Articles in International Peer-Reviewed Journal

[11]
D. Augot, M. Bardet, J.-C. Faugère.
On the decoding of cyclic codes with the Newton's identities, in: Journal of Symbolic Computation, Special Issue on Gröbner Bases Techniques in Cryptography and Coding Theory, to appear, 2008, 29 p
http://www-rocq.inria.fr/secret/Daniel.Augot/gbdecode.pdf.
[12]
A. Canteaut, P. Charpin, G. Kyureghyan.
A new class of monomial bent functions, in: Finite Fields and Their Applications, January 2008, vol. 14, no 1, p. 221-241.
[13]
P. Charpin, G. Gong.
Hyperbent functions, Kloosterman sums and Dickson polynomials, in: IEEE Transactions on Information Theory, Regular paper, September 2008, vol. 54, no 9, p. 4230-4238.
[14]
P. Charpin, T. Helleseth, V. Zinoviev.
Divisibility properties of classical binary Kloosterman sums, in: Discrete Mathematics, In press, 2008.
[15]
P. Charpin, T. Helleseth, V. Zinoviev.
On cosets of weight 4 of BCH(2 m, 8) , m even, and exponential sums, in: SIAM Journal of Discrete Math., 2008, vol. 23, no 1, p. 59-78.
[16]
P. Charpin, G. Kyureghyan.
Cubic monomial bent functions: a subclass of Im2 $\#8499 $ , in: SIAM Journal of Discrete Math., 2008, vol. 22, no 2, p. 650-665.

Invited Conferences

[17]
A. Canteaut.
Approximation of a combining function by functions of fewer variables, in: ESC 2008 - Echternach Symmetric Cryptography seminar, Echternach, Luxembourg, Invited talk, January 2008.
[18]
A. Canteaut.
La cryptographie symétrique : comment protéger la confidentialité des données à moindre coût, in: Le modèle et l'algorithme, INRIA Paris-Rocquencourt, November 2008
http://www-c.inria.fr/Internet/rendez-vous/modele-et-algo/les-exposes-de-2008/la-cryptographie-symetrique-comment-proteger-la-confidentialite-des-donnees-a-moindre-cout.
[19]
J.-P. Tillich.
Quantum Turbo-codes, in: Journées "Informatique Quantique" 2008, Paris, Invited Talk, January 2008.
[20]
J.-P. Tillich.
Une introduction aux codes correcteurs quantiques, in: Journées "Codage et Cryptographie" 2008, Carcans (Gironde), Invited Talk, March 2008.

International Peer-Reviewed Conference/Proceedings

[21]
D. Augot, A. Zeh.
On the Roth and Ruckenstein Equations for the Guruswami-Sudan Algorithm, in: Proceedings of the 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, Canada, July 2008, p. 2620-2624.
[22]
B. Biswas, N. Sendrier.
McEliece cryptosystem in real life: theory and practice, in: International Workshop on Post-Quantum Cryptography - PQCrypto 2008, LNCS, Springer, 2008, vol. 5299, p. 47-62.
[23]
P. Charpin, G. Gong.
Hyperbent functions, Kloosterman sums and Dickson polynomials, in: Proceedings of the 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, Canada, July 2008, p. 1758-1762.
[24]
P. Charpin, T. Helleseth, V. Zinoviev.
Divisibility properties of Kloosterman sums over finite fields of characteristic two, in: Proceedings of the 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, Canada, July 2008, p. 2608-2612.
[25]
P. Charpin, G. Kyureghyan.
On a class of permutation polynomials over Im3 $\#119813 _2^n$ , in: Sequences and Their Applications, SETA 2008, LNCS, Springer, 2008, no 5203, p. 368–376.
[26]
M. Cluzeau, J.-P. Tillich.
On the code reverse engineering problem, in: Proceedings of the 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, Canada, July 2008, p. 634-638.
[27]
D. K. Dalai.
On 3-to-1 and power APN S-boxes, in: Sequences and Their Applications, SETA 2008, LNCS, Springer, 2008, no 5203, p. 377–389.
[28]
C. Faure, L. Minder.
Cryptanalysis of the McEliece cryptosystem over hyperelliptic codes, in: Proceedings of the 11th international workshop on Algebraic and Combinatorial Coding Theory, ACCT 2008, 2008, p. 99–107.
[29]
C. Lauradoux, A. Röck.
Parallel Generation of l -sequences, in: Sequences and Their Applications, SETA 2008, LNCS, Springer, 2008, no 5203, p. 299-312.
[30]
S. Manuel, T. Peyrin.
Collisions on SHA-0 in One Hour, in: Fast Software Encryption - FSE 2008, LNCS, Springer, 2008, no 5086, p. 16-35.
[31]
A. Otmani, J.-P. Tillich, L. Dallot.
Cryptanalysis of McEliece Cryptosystem Based on Quasi-Cyclic LDPC Codes, in: Proceedings of First International Conference on Symbolic Computation and Cryptography, Beijing, China, LMIB Beihang University , April 28-30 2008, p. 69–81.
[32]
D. Poulin, J.-P. Tillich, H. Ollivier.
Quantum serial turbo-codes, in: Proceedings of the 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, Canada, July 2008, p. 310-314.
[33]
A. Röck.
Entropy of the Internal State of an FCSR in Galois representation, in: Fast Software Encryption - FSE 2008, LNCS, Springer, 2008, no 5086, p. 343-362.
[34]
A. Röck.
Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State, in: AFRICACRYPT 2008, LNCS, Springer, 2008, no 5023, p. 258-275.
[35]
J.-P. Tillich, G. Zémor.
Collisions for the LPS expander graph hash function, in: Advances in Cryptology - EUROCRYPT 2008, LNCS, Springer, 2008, no 4965, p. 254–269.

Workshops without Proceedings

[36]
D. Augot, A. Zeh.
Key Equations for the Guruswami-Sudan Decoding Algorithm, in: Workshop on Coding and Systems, Alicante, Spain, March 2008.
[37]
B. Biswas, N. Sendrier.
Cryptosystème de McEliece: sécurité et implémentation, in: Journées "Codage et Cryptographie" 2008, Carcans (Gironde), March 2008.
[38]
A. Canteaut, M. Naya-Plasencia.
Approximation d'une fonction à l'aide de moins de variables, in: Journées "Codage et Cryptographie" 2008, Carcans (Gironde), March 2008.
[39]
F. Didier, Y. Laigle-Chapuy.
Cryptanalyse de LFSRs combinés, in: Journées "Codage et Cryptographie" 2008, Carcans (Gironde), March 2008.
[40]
B. Gérard, J.-P. Tillich.
Codage et cryptanalyse linéaire, in: Journées "Codage et Cryptographie" 2008, Carcans (Gironde), March 2008.
[41]
C. Lauradoux, A. Röck.
Parallel Generation of $ \ell$ -Sequences, in: Kryptowochenende, Tabarz, Germany, March 2008.
[42]
C. Lauradoux, A. Röck.
Synthèse des $ \ell$ -séquences décimées, in: Journées "Codage et Cryptographie" 2008, Carcans (Gironde), March 2008.
[43]
S. Manuel.
Produire une collision pour SHA-0 en une heure, in: Journées "Codage et Cryptographie" 2008, Carcans (Gironde), March 2008.
[44]
A. Otmani, J.-P. Tillich, L. Dallot.
Cryptanalyse d'un cryptosystème de McEliece utilisant des codes LDPC quasi-cycliques, in: Journées "Codage et Cryptographie" 2008, Carcans (Gironde), March 2008.
[45]
N. Sendrier.
Codage des mots de poids constant, in: Journées "Codage et Cryptographie" 2008, Carcans (Gironde), March 2008.

Scientific Books (or Scientific Book chapters)

[46]
F. Arnault, T. Berger, C. Lauradoux.
F-FCSR stream ciphers, in: New Stream Cipher Designs - The eSTREAM finalists, LNCS, Springer, 2008, vol. 4986, p. 170-178.
[47]
D. Augot, E. Betti, E. Orsini.
An introduction to linear and cyclic codes, in: Gröbner Bases, Coding, and Cryptography, RISC Book Series, to appear, Springer , Heidelberg, 2009.
[48]
D. Augot, M. Stepanov.
A note on the generalisation of the Guruswami-Sudan list decoding algorithm to Reed-Muller codes, in: Gröbner Bases, Coding, and Cryptography, RISC Book Series, to appear, Springer , Heidelberg, 2009.
[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 v2, in: New Stream Cipher Designs - The eSTREAM finalists, LNCS, Springer, 2008, vol. 4986, p. 140-151.
[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 software-oriented stream cipher, in: New Stream Cipher Designs - The eSTREAM finalists, LNCS, Springer, 2008, vol. 4986, p. 98-118.
[51]
R. Overbeck, N. Sendrier.
Code-based cryptography, in: Post-Quantum Cryptography, to appear, Springer, 2008.

Books or Proceedings Editing

[52]
D. Augot, J.-C. Faugère, L. Perret (editors)
Gröbner Bases Techniques in Cryptography and Coding Theory, Springer, to appear.
[53]
P. Charpin, T. Helleseth, D. Augot, G. Leander, N. Sendrier (editors)
Special issue in Coding and Cryptography - In memory of Hans Dobbertin, Designs, Codes and Cryptography, Springer, 2008, vol. 49 (1–3).

Other Publications

[54]
D. Augot, M. Finiasz, P. Gaborit, S. Manuel, N. Sendrier.
SHA-3 proposal: FSB, October 2008
http://www-rocq.inria.fr/secret/CBCrypto/fsbdoc.pdf, Submission to NIST.
[55]
J.-P. Aumasson, W. Meier, M. Naya-Plasencia, T. Peyrin.
Inside the Hypercube, November 2008
http://eprint.iacr.org/2008/486.pdf, Cryptology ePrint Archive, Report 2008/486.
[56]
J.-P. Aumasson, M. Naya-Plasencia.
Second preimages on MCSSHA-3, November 2008
http://131002.net/data/papers/AN08.pdf, Available online.
[57]
C. Blondeau.
La cryptanalyse différentielle tronquée, 64 pages. Supervision : Pascale Charpin, Université de Limoges, September 2008.
[58]
A. Canteaut, D. Augot, C. Cid, H. Englund, H. Gilbert, M. Hell, T. Johansson, M. Parker, T. Pornin, B. Preneel, C. Rechberger, M. Robshaw.
D.STVL.9 - Ongoing Research Areas in Symmetric Cryptography, 108 pages, July 2008, Report of the ECRYPT European Network of Excellence.
[59]
A. Canteaut, B. Chevallier-Mames, A. Gouget, P. Paillier, T. Pornin, E. Bresson, C. Clavier, T. Fuhr, T. Icart, J. Misarsky, M. Naya-Plasencia, J. Reinhard, C. Thuillet, M. Videau.
Shabal, a Submission to NIST's Cryptographic Hash Algorithm Competition, October 2008, Submission to NIST.
[60]
C. Cid, M. Albrecht, D. Augot, A. Canteaut, R.-P. Weinmann.
D.STVL.7 - Algebraic cryptanalysis of symmetric primitives, 42 pages, July 2008, Report of the ECRYPT European Network of Excellence.
[61]
V. Herbert.
Systèmes d'authentification basés sur les codes correcteurs d'erreurs, 60 pages. Supervision: Nicolas Sendrier, Université de Grenoble, September 2008.
[62]
S. Jacob.
Analyse de la résistance aux attaques algébriques des fonctions de filtrage augmentées, Supervision: Anne Canteaut, Université Paris 7, November 2008.
[63]
M. Naya-Plasencia.
Second preimage attack on Ponic, November 2008
http://131002.net/data/papers/ponic.pdf, Available online.
[64]
J.-C. Sibel.
Décodage de codes correcteurs quantiques, Supervision: Jean-Pierre Tillich, September 2008, Engineering school internship report.
[65]
J.-P. Tillich.
Contrat de recherche France Télécom: application des codes Treillis/turbo-LDPC aux modulations codées à grand nombre d'états, 54 pages, November 2008, Final report of the France Télécom contract.
[66]
A. Zeh.
A Key Equation for the Guruswami-Sudan Algorithm, Supervision : Daniel Augot, Télécom Paris, February 2008.

References in notes

[67]
D. Augot, M. Bardet, J.-C. Faugère.
Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Groebner bases, in: Proceedings of the 2003 IEEE International Symposium on Information Theory, ISIT 2003, Yokohama, Japan, IEEE Press, June 2003, 362 p.
[68]
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.
[69]
M. Baldi, F. Chiaraluce.
Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes, in: Proceedings of the 2007 IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, March 2007, p. 2591–2595.
[70]
M. Bardet.
Etude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie, PhD Thesis, Université Paris 6, December 2004.
[71]
N. Courtois, M. Finiasz, N. Sendrier.
How to achieve a McEliece-based Digital Signature Scheme, in: Advances in Cryptology - Asiacrypt 2001, LNCS, Springer-Verlag, 2001, no 2248, p. 157–174.
[72]
P. Gaborit.
Shorter keys for code based cryptography, in: International Workshop on Coding and Cryptography - WCC 2005, Bergen, Norway, March 2005, p. 81–91.
[73]
N. Sendrier.
Cryptosystèmes à clé publique basés sur les codes correcteurs d'erreurs, Mémoire d'habilitation à diriger des recherches, Université Paris 6, March 2002.
[74]
N. Sendrier.
On the security of the McEliece public-key cryptosystem, in: Information, Coding and Mathematics, In honor of Bob McEliece on his 60th birthday. Invited paper, Kluwer, 2002, p. 141–163.
[75]
C. Tavernier.
Testeurs, problèmes de reconstruction univariés et multivariés, et application à la cryptanalyse du DES., PhD thesis, École Polytechnique, Palaiseau, January 2004.

previous
next