Sélection de publications

Codes correcteurs quantiques

• "A family of quantum codes with performances close to the hashing bound under iterative decoding" M. Denise, J.P. Tillich, I. Andriyanova, à paraître dans ISIT 2013.
• "Quantum LDPC codes with positive rate and minimum distance proportional to $n^{1/2}$", J.P. Tillich et G. Zémor, soumis à IEEE Transactions on Information Theory.
• "Spatially coupled quantum LDPC codes", I. Andriyanova, D. Maurice, J.P. Tillich, ITW 2012, 2012, p.327-331.
• "Quantum LDPC codes obtained by non-binary constructions" I. Andriyanova, D. Maurice, J.P. Tillich, ISIT 2012, Boston, juillet 2012, p. 343-347.
• "Quantum turbo codes with unbounded minimum distance and excellent error-reducing performance", M. Abbara, J.P. Tillich, actes de Information Theory Workshop, ITW 2011, 2011, p. 252-256.
• "Quantum serial turbo-codes", D.Poulin, J.P. Tillich et H. Ollivier, IEEE Transactions on Information Theory 2009.
• "A class of quantum LDPC codes ; construction and performances under iterative decoding", T. Camara, H. Ollivier et J.P. Tillich, actes d'ISIT 2007, Nice, p.811-815.
• "Trellises for stabilizer codes : definition and uses", H. Ollivier et J.P. Tillich, Physical Review A, 2006, vol 74, No. 3.
• "Description of a quantum convolutional code", H. Ollivier et J.P. Tillich, Physical Review Letters,91,17,177902, 2003.

Codes correcteurs classiques

• "On a low-rate TLDPC code ensemble and necessary conditions for a sparse-graph code ensemble to be asymptotically good", IEEE Transactions on Communications, Vol 60, No. 11, 2012, p.3181-3190.
• "On the binary weight distribution of non-binary LDPC codes", I. Andriyanova, V. Rathi et J.P. Tillich, publié à ISIT 2009, S\'eoul, juillet 2009, p.65-69.
• "On the code reverse engineering problem", M. Cluzeau et J.P. Tillich, actes d'ISIT 2008, p.634-638.
• "Spectral estimates for Abelian Cayley graphs", J. Friedman et R. Murty et J.P. Tillich, Journal of Combinatorial Theory Ser.B, Septembre 2006, vol. 96,No. 1, p.111-121.
• "Generalized Alon-Boppana Theorems and Error-Correcting Codes", J. Friedman et J.P. Tillich, SIAM Journal of Discrete Mathematics, Vol. 19, No.3, Aug. 2005, p.700-718.
• "Discrete isoperimetric inequalities and the probability of a decoding error", J.P. Tillich et G. Zémor, Combinatorics, Probability and Computing, Vol. 9, 2000, p.465-579.
• "Optimal cycle codes constructed from Ramanujan graphs", J.P. Tillich et G. Zémor, SIAM Journal of Discrete Mathematics, Vol. 10, No. 3, August 1997, p.447-459.

Cryptologie

• "RankSynd a PRNG Based on Rank Metric" P. Gaborit, A. Hauteville, J.P. Tillich, Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, February 24-26, 2016, Proceedings, LNCS 9606, p18-28.
• "An Efficient Attack on a Code-based Signature Scheme" A. Phesso, J.P. Tillich, Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, February 24-26, 2016, Proceedings, LNCS 9606, p86-103.
• "Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes" A. Couvreur, P. Gaborit, V. Gauthier, A. Otmani, J.P. Tillich, actes de WCC 2013.
• "An efficient attack of a McEliece cryptosystem variant based on convolutional codes" G. Landais, J.P. Tillich, arXiv.org:1302.2136, à paraître dans PQCrypto 2013.
• "New McEliece Variants from Moderate Density Parity-Check Codes", R. Misocski, J.P. Tillich, N. Sendrier, P.~Barreto, IACR Cryptology ePrint Archive 2012/409, une version courte est à paraitre dans ISIT 2013.
• "A distinguisher for high rate McEliece cryptosystems" J.C. Faugère, V. Gauthier, A. Otmani, L. Perret, J.P. Tillich, IACR eprint 2010/331, soumis à IEEE Transactions on Information Theory.
• "Accurate estimates of the data complexity and success probability for various cryptanalyses", C.~Blondeau, B.~Gérard, J.P. Tillich, Designs Codes and Cryptography, Special issue on Coding and Cryptography, Vol. 1-3, 2011, p.3-34.
• B. Gérard, J.P. Tillich, "Using Tools from Error Correcting Theory in Linear Cryptanalysis" Advanced Linear Cryptanalysis of Block and Stream Ciphers, Vol. 7, Cryptology and Information Security Series, octobre 2011, p.87-114.
• "Algebraic cryptanalysis of McEliece variants with compact keys" J.C. Faugère, A.~Otmani, L.~Perret, J.P. Tillich, actes d'Eurocrypt 2010.
• "On linear cryptanalysis with many linear approximations" B. Gérard, J.P. Tillich, actes de Cryptography and Coding, 12th IMA International Conference, Cryptography and Coding 2009,
• "Hard and easy components of collision search in the Zemor-Tillich hash function: new attacks and reduced variants of equivalent security", C. Petit, J.P. Tillich et G. Zémor, actes de CT-RSA 2009.
• "Collisions for the LPS hash function", J.P. Tillich et G. Zémor, actes d'Eurocrypt 2008, LNCS 4965, p.254-269.
• "Computing the algebraic immunity efficiently",, F. Didier et J.P. Tillich, Fast Software Encryption FSE 2006, LNCS 4047, Springer-Verlag, 2006, p.359-374.
• "Hashing with SL2", J.P. Tillich et G. Zémor, Advances in Cryptology, actes de CRYPTO'94, LNCS 839, 1994, p.40-49.

Théorie des graphes

• "Wave equations on graphs and the edge-based Laplacian", J. Friedman et J.P. Tillich, Pacific Journal of Mathematics, Vol. 216, No.2, Octobre 2004, p.229-266.
• "Laplacian Eigenvalues and Distances Between Subsets of a Manifold",, J. Friedman et J.P. Tillich, Journal of Differential Geometry, Vol. 56, No.2, October 2000, p.285-299.
• "Edge-isoperimetric inequalities for product graphs", J.P. Tillich, Discrete Mathematics, Vol. 213, No. 1-3, février 2000, p.291-320.
• "The action of a few permutations on r-tuples is quickly transitive", J. Friedman, A. Joux, Y. Roichman, J. Stern et J.P. Tillich, Random Structures and Algorithms}, Vol. 12, No. 4, Juillet 1998, p.335-350.
• "Eigenvalues, eigenspaces and distances to subsets", C. Delorme et J.P. Tillich, dédié au 5 ème Colloque International Théorie des Graphes et Combinatoire, Vol. 165/166, 1997, p.171-194.

Dernière mise à jour: 20 février 2009