Jean-Pierre Tillich

According to our database1, Jean-Pierre Tillich authored at least 111 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Revisiting algebraic attacks on MinRank and on the rank decoding problem.
Des. Codes Cryptogr., November, 2023

Smoothing Codes and Lattices: Systematic Study and New Bounds.
IEEE Trans. Inf. Theory, September, 2023

On the dimension and structure of the square of the dual of a Goppa code.
Des. Codes Cryptogr., April, 2023

Rigorous Foundations for Dual Attacks in Coding Theory.
IACR Cryptol. ePrint Arch., 2023

A new approach based on quadratic forms to attack the McEliece cryptosystem.
IACR Cryptol. ePrint Arch., 2023

The Quantum Decoding Problem.
IACR Cryptol. ePrint Arch., 2023

Projective Space Stern Decoding and Application to SDitH.
IACR Cryptol. ePrint Arch., 2023

Reduction from sparse LPN to LPN, Dual Attack 3.0.
IACR Cryptol. ePrint Arch., 2023

Polynomial time attack on high rate random alternant codes.
CoRR, 2023

Time and Query Complexity Tradeoffs for the Dihedral Coset Problem.
Proceedings of the Post-Quantum Cryptography - 14th International Workshop, 2023

2022
Faster Dual Lattice Attacks by Using Coding Theory.
IACR Cryptol. ePrint Arch., 2022

Statistical Decoding 2.0: Reducing Decoding to LPN.
IACR Cryptol. ePrint Arch., 2022

2021
Quantum Reduction of Finding Short Code Vectors to the Decoding Problem.
IACR Cryptol. ePrint Arch., 2021

A polynomial time key-recovery attack on the Sidon cryptosystem.
IACR Cryptol. ePrint Arch., 2021

Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Algebraic attacks for solving the Rank Decoding and MinRank problems without Gröbner basis.
CoRR, 2020

An Algebraic Attack on Rank Metric Code-Based Cryptosystems.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
About Wave Implementation and its Leakage Immunity.
IACR Cryptol. ePrint Arch., 2019

Identifying an unknown code by partial Gaussian elimination.
Des. Codes Cryptogr., 2019

Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
A polynomial attack on a NIST proposal: RankSign, a code-based signature in rank metric.
IACR Cryptol. ePrint Arch., 2018

This is Not an Attack on Wave.
IACR Cryptol. ePrint Arch., 2018

Wave: A New Code-Based Signature Scheme.
IACR Cryptol. ePrint Arch., 2018

Recovering short secret keys of RLCE in polynomial time.
IACR Cryptol. ePrint Arch., 2018

An attack on a NIST proposal: RankSign, a code-based signature in rank metric.
CoRR, 2018

Attack on the Edon-K Key Encapsulation Mechanism.
CoRR, 2018

The Decoding Failure Probability of MDPC Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Attack on the Edon-kKey Encapsulation Mechanism.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

A New Algorithm for Solving the Rank Syndrome Decoding Problem.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Two Attacks on Rank Metric Code-Based Schemes: RankSign and an IBE Scheme.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions.
IEEE Trans. Inf. Theory, 2017

Quantum Information Set Decoding Algorithms.
IACR Cryptol. ePrint Arch., 2017

Identity-based Encryption from Codes with Rank Metric.
IACR Cryptol. ePrint Arch., 2017

A new signature scheme based on (U|U+V) codes.
IACR Cryptol. ePrint Arch., 2017

CAKE: Code-based Algorithm for Key Encapsulation.
IACR Cryptol. ePrint Arch., 2017

Editorial: Special issue on coding and cryptography.
Des. Codes Cryptogr., 2017

Attaining Capacity with Algebraic Geometry Codes through the (U|U+V) Construction and Koetter-Vardy Soft Decoding.
CoRR, 2017

Statistical decoding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Attaining capacity with iterated (U|U + V) codes based on AG codes and Koetter-Vardy soft decoding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups.
IEEE Trans. Inf. Theory, 2016

A Polynomial-Time Attack on the BBCRS Scheme.
IACR Cryptol. ePrint Arch., 2016

Code-Based Cryptography: New Security Solutions Against a Quantum Adversary.
ERCIM News, 2016

Structural cryptanalysis of McEliece schemes with compact keys.
Des. Codes Cryptogr., 2016

Using Reed-Solomon codes in the $\left( U\mid U+V\right)$ construction and an application to cryptography.
CoRR, 2016

An Efficient Attack on a Code-Based Signature Scheme.
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

RankSynd a PRNG Based on Rank Metric.
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes.
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

Using Reed-Solomon codes in the (U | U + V ) construction and an application to cryptography.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Algebraic properties of polar codes from a new polynomial formalism.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Quantum Expander Codes.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength.
IEEE Trans. Inf. Theory, 2014

New identities relating wild Goppa codes.
Finite Fields Their Appl., 2014

Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes.
Des. Codes Cryptogr., 2014

Recovering the interleaver of an unknown turbo-code.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Structural weakness of compact variants of the McEliece cryptosystem.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

A decoding algorithm for CSS codes using the X/Z correlations.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Detecting and reconstructing an unknown convolutional code by counting collisions.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
A Distinguisher for High-Rate McEliece Cryptosystems.
IEEE Trans. Inf. Theory, 2013

An efficient attack of a McEliece cryptosystem variant based on convolutional codes.
IACR Cryptol. ePrint Arch., 2013

A family of quantum codes with performances close to the hashing bound under iterative decoding.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Designing a Good Low-Rate Sparse-Graph Code.
IEEE Trans. Commun., 2012

MDPC-McEliece: New McEliece Variants from Moderate Density Parity-Check Codes.
IACR Cryptol. ePrint Arch., 2012

A Distinguisher-Based Attack of a Homomorphic Encryption Scheme Relying on Reed-Solomon Codes.
IACR Cryptol. ePrint Arch., 2012

A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes
CoRR, 2012

New constructions of CSS codes obtained by moving to higher alphabets
CoRR, 2012

Spatially coupled quantum LDPC codes.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Quantum LDPC codes obtained by non-binary constructions.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
An Efficient Attack on All Concrete KKS Proposals.
IACR Cryptol. ePrint Arch., 2011

Accurate estimates of the data complexity and success probability for various cryptanalyses.
Des. Codes Cryptogr., 2011

Quantum turbo codes with unbounded minimum distance and excellent error-reducing performance.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010
Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes.
Math. Comput. Sci., 2010

On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
CoRR, 2010

Methods for the reconstruction of parallel turbo codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Algebraic Cryptanalysis of McEliece Variants with Compact Keys.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009
Quantum serial turbo codes.
IEEE Trans. Inf. Theory, 2009

On Linear Cryptanalysis with Many Linear Approximations.
IACR Cryptol. ePrint Arch., 2009

Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
CoRR, 2009

Quantum LDPC codes with positive rate and minimum distance proportional to n<sup>½</sup>.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security.
Proceedings of the Topics in Cryptology, 2009

2008
On the code reverse engineering problem.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Collisions for the LPS Expander Graph Hash Function.
Proceedings of the Advances in Cryptology, 2008

2007
On the Minimum Distance of Generalized LDPC Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A class of quantum LDPC codes: construction and performances under iterative decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A family of non-binary TLDPC codes: density evolution, convergence and thresholds.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Spectral estimates for Abelian Cayley graphs.
J. Comb. Theory, Ser. B, 2006

On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

A new family of codes with high iterative decoding performances.
Proceedings of IEEE International Conference on Communications, 2006

Computing the Algebraic Immunity Efficiently.
Proceedings of the Fast Software Encryption, 13th International Workshop, 2006

2005
Generalized Alon--Boppana Theorems and Error-Correcting Codes.
SIAM J. Discret. Math., 2005

Asymptotically good codes with high iterative decoding performances.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel.
IEEE Trans. Inf. Theory, 2004

New spectral lower bounds on the bisection width of graphs.
Theor. Comput. Sci., 2004

Calculus on Graphs
CoRR, 2004

The average weight distribution of Tanner code ensembles and a way to modify them to improve their weight distribution.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2001
Automatic Detection of a Watermarked Document Using a Private Key.
Proceedings of the Information Hiding, 4th International Workshop, 2001

Low Complexity Tail-Biting Trellises of Self-dual codes of Length 24, 32 and 40 over GF(2) and Z<sub>4</sub> of Large Minimum Distance.
Proceedings of the Applied Algebra, 2001

2000
Edge isoperimetric inequalities for product graphs.
Discret. Math., 2000

Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error.
Comb. Probab. Comput., 2000

1999
An Overview of the Isoperimetric Method in Coding Theory.
Proceedings of the Cryptography and Coding, 1999

1998
The action of a few permutations on r-tuples is quickly transitive.
Random Struct. Algorithms, 1998

The Spectrum of de Bruijn and Kautz Graphs.
Eur. J. Comb., 1998

On the dual distance and the gap of a binary code.
Discret. Math., 1998

1997
Optimal Cycle Codes Constructed From Ramanujan Graphs.
SIAM J. Discret. Math., 1997

Eigenvalues, eigenspaces and distances to subsets.
Discret. Math., 1997

1996
The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography.
Proceedings of the STACS 96, 1996

1995
Block Codes for Dyadic Phase Shift Keying.
Proceedings of the Combinatorics and Computer Science, 1995

1994
Hashing with SL_2.
Proceedings of the Advances in Cryptology, 1994

1993
Group-theoretic hash functions.
Proceedings of the Algebraic Coding, 1993


  Loading...