| 2013 | ||
|---|---|---|
| i15 | Grégory Landais, Jean-Pierre Tillich: An efficient attack of a McEliece cryptosystem variant based on convolutional codes. CoRR abs/1302.5120 (2013) | |
| i14 | Grégory Landais, Jean-Pierre Tillich: An efficient attack of a McEliece cryptosystem variant based on convolutional codes. IACR Cryptology ePrint Archive 2013: 80 (2013) | |
| 2012 | ||
| j15 | Iryna Andriyanova, Jean-Pierre Tillich: Designing a Good Low-Rate Sparse-Graph Code. IEEE Transactions on Communications 60(11): 3181-3190 (2012) | |
| c20 | Iryna Andriyanova, Denise Maurice, Jean-Pierre Tillich: Quantum LDPC codes obtained by non-binary constructions. ISIT 2012: 343-347 | |
| i13 | Iryna Andriyanova, Denise Maurice, Jean-Pierre Tillich: New constructions of CSS codes obtained by moving to higher alphabets. CoRR abs/1202.3338 (2012) | |
| i12 | Valérie Gauthier, Ayoub Otmani, Jean-Pierre Tillich: A Distinguisher-Based Attack of a Homomorphic Encryption Scheme Relying on Reed-Solomon Codes. CoRR abs/1203.6686 (2012) | |
| i11 | Valérie Gauthier, Ayoub Otmani, Jean-Pierre Tillich: A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes. CoRR abs/1204.6459 (2012) | |
| i10 | Valérie Gauthier, Ayoub Otmani, Jean-Pierre Tillich: A Distinguisher-Based Attack of a Homomorphic Encryption Scheme Relying on Reed-Solomon Codes. IACR Cryptology ePrint Archive 2012: 168 (2012) | |
| i9 | Rafael Misoczki, Jean-Pierre Tillich, Nicolas Sendrier, Paulo S. L. M. Barreto: MDPC-McEliece: New McEliece Variants from Moderate Density Parity-Check Codes. IACR Cryptology ePrint Archive 2012: 409 (2012) | |
| 2011 | ||
| j14 | Céline Blondeau, Benoît Gérard, Jean-Pierre Tillich: Accurate estimates of the data complexity and success probability for various cryptanalyses. Des. Codes Cryptography 59(1-3): 3-34 (2011) | |
| c19 | Ayoub Otmani, Jean-Pierre Tillich: An Efficient Attack on All Concrete KKS Proposals. PQCrypto 2011: 98-116 | |
| i8 | Ayoub Otmani, Jean-Pierre Tillich: An Efficient Attack on All Concrete KKS Proposals. IACR Cryptology ePrint Archive 2011: 356 (2011) | |
| 2010 | ||
| j13 | Ayoub Otmani, Jean-Pierre Tillich, Léonard Dallot: Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes. Mathematics in Computer Science 3(2): 129-140 (2010) | |
| c18 | Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich: Algebraic Cryptanalysis of McEliece Variants with Compact Keys. EUROCRYPT 2010: 279-298 | |
| c17 | Mathieu Cluzeau, Matthieu Finiasz, Jean-Pierre Tillich: Methods for the reconstruction of parallel turbo codes. ISIT 2010: 2008-2012 | |
| i7 | Mathieu Cluzeau, Matthieu Finiasz, Jean-Pierre Tillich: Methods for the Reconstruction of Parallel Turbo Codes. CoRR abs/1006.0259 (2010) | |
| i6 | Iryna Andriyanova, Jean-Pierre Tillich: On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes. CoRR abs/1010.1911 (2010) | |
| i5 | Jean-Charles Faugère, Valérie Gauthier, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich: A Distinguisher for High Rate McEliece Cryptosystems. IACR Cryptology ePrint Archive 2010: 331 (2010) | |
| 2009 | ||
| j12 | David Poulin, Jean-Pierre Tillich, Harold Ollivier: Quantum serial turbo codes. IEEE Transactions on Information Theory 55(6): 2776-2798 (2009) | |
| c16 | Christophe Petit, Jean-Jacques Quisquater, Jean-Pierre Tillich, Gilles Zémor: Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security. CT-RSA 2009: 182-194 | |
| c15 | Benoît Gérard, Jean-Pierre Tillich: On Linear Cryptanalysis with Many Linear Approximations. IMA Int. Conf. 2009: 112-132 | |
| c14 | Jean-Pierre Tillich, Gilles Zémor: Quantum LDPC codes with positive rate and minimum distance proportional to n½. ISIT 2009: 799-803 | |
| i4 | Jean-Pierre Tillich, Gilles Zémor: Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}. CoRR abs/0903.0566 (2009) | |
| i3 | Benoît Gérard, Jean-Pierre Tillich: On Linear Cryptanalysis with Many Linear Approximations. IACR Cryptology ePrint Archive 2009: 463 (2009) | |
| 2008 | ||
| c13 | Jean-Pierre Tillich, Gilles Zémor: Collisions for the LPS Expander Graph Hash Function. EUROCRYPT 2008: 254-269 | |
| c12 | ||
| c11 | ||
| i2 | Ayoub Otmani, Jean-Pierre Tillich, Léonard Dallot: Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes. CoRR abs/0804.0409 (2008) | |
| 2006 | ||
| j11 | Joel Friedman, Ram Murty, Jean-Pierre Tillich: Spectral estimates for Abelian Cayley graphs. J. Comb. Theory, Ser. B 96(1): 111-121 (2006) | |
| c10 | Frédéric Didier, Jean-Pierre Tillich: Computing the Algebraic Immunity Efficiently. FSE 2006: 359-374 | |
| c9 | Iryna Andriyanova, Jean-Pierre Tillich, Jean-Claude Carlach: A new family of codes with high iterative decoding performances. ICC 2006: 1177-1182 | |
| 2005 | ||
| j10 | Joel Friedman, Jean-Pierre Tillich: Generalized Alon--Boppana Theorems and Error-Correcting Codes. SIAM J. Discrete Math. 19(3): 700-718 (2005) | |
| 2004 | ||
| j9 | Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich: New spectral lower bounds on the bisection width of graphs. Theor. Comput. Sci. 320(2-3): 155-174 (2004) | |
| j8 | Jean-Pierre Tillich, Gilles Zémor: The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel. IEEE Transactions on Information Theory 50(2): 328-331 (2004) | |
| i1 | ||
| 2001 | ||
| c8 | E. Cadic, Jean-Claude Carlach, G. Olocco, Ayoub Otmani, Jean-Pierre Tillich: Low Complexity Tail-Biting Trellises of Self-dual codes of Length 24, 32 and 40 over GF(2) and Z4 of Large Minimum Distance. AAECC 2001: 57-66 | |
| c7 | Julien P. Stern, Jean-Pierre Tillich: Automatic Detection of a Watermarked Document Using a Private Key. Information Hiding 2001: 258-272 | |
| 2000 | ||
| j7 | Jean-Pierre Tillich, Gilles Zémor: Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error. Combinatorics, Probability & Computing 9(5): 465-479 (2000) | |
| j6 | Jean-Pierre Tillich: Edge isoperimetric inequalities for product graphs. Discrete Mathematics 213(1-3): 291-320 (2000) | |
| c6 | Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich: New Spectral Lower Bounds on the Bisection Width of Graphs. WG 2000: 23-34 | |
| 1999 | ||
| c5 | Jean-Pierre Tillich, Gilles Zémor: An Overview of the Isoperimetric Method in Coding Theory. IMA Int. Conf. 1999: 129-134 | |
| 1998 | ||
| j5 | Patrick Solé, Jean-Pierre Tillich: On the dual distance and the gap of a binary code. Discrete Mathematics 192(1-3): 333-336 (1998) | |
| j4 | Charles Delorme, Jean-Pierre Tillich: The Spectrum of de Bruijn and Kautz Graphs. Eur. J. Comb. 19(3): 307-319 (1998) | |
| j3 | Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich: The action of a few permutations on r-tuples is quickly transitive. Random Struct. Algorithms 12(4): 335-350 (1998) | |
| 1997 | ||
| j2 | Charles Delorme, Jean-Pierre Tillich: Eigenvalues, eigenspaces and distances to subsets. Discrete Mathematics 165-166: 171-194 (1997) | |
| j1 | Jean-Pierre Tillich, Gilles Zémor: Optimal Cycle Codes Constructed From Ramanujan Graphs. SIAM J. Discrete Math. 10(3): 447-459 (1997) | |
| 1996 | ||
| c4 | Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich: The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography. STACS 1996: 375-386 | |
| 1995 | ||
| c3 | Patrick Solé, Jean-Pierre Tillich: Block Codes for Dyadic Phase Shift Keying. Combinatorics and Computer Science 1995: 244-262 | |
| 1994 | ||
| c2 | ||
| 1993 | ||
| c1 | ||
Colors in the list of coauthors
Last update Tue May 21 19:59:43 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page