Jean-Pierre Tillich

From MaRDI portal
Person:264130

Available identifiers

zbMath Open tillich.jean-pierreMaRDI QIDQ264130

List of research outcomes





PublicationDate of PublicationType
Reduction from sparse LPN to LPN, dual attack 3.02024-11-13Paper
A polynomial time key-recovery attack on the Sidon cryptosystem2024-10-14Paper
A new approach based on quadratic forms to attack the McEliece cryptosystem2024-09-13Paper
Rigorous foundations for dual attacks in coding theory2024-08-15Paper
Polynomial time key-recovery attack on high rate random alternant codes2024-07-23Paper
Quantum reduction of finding short code vectors to the decoding problem2024-07-23Paper
Smoothing codes and lattices: systematic study and new bounds2024-07-19Paper
Block codes for dyadic phase shift keying2024-07-05Paper
Time and Query Complexity Tradeoffs for the Dihedral Coset Problem2024-04-26Paper
Revisiting algebraic attacks on MinRank and on the rank decoding problem2023-11-07Paper
Statistical decoding 2.0: reducing decoding to LPN2023-08-21Paper
On the dimension and structure of the square of the dual of a Goppa code2023-04-12Paper
Improvements of algebraic attacks for solving the rank decoding and MinRank problems2023-03-21Paper
An algebraic attack on rank metric code-based cryptosystems2021-12-01Paper
On the dimension and structure of the square of the dual of a Goppa code2021-11-25Paper
Wave: a new family of trapdoor one-way preimage sampleable functions based on codes2020-05-20Paper
Recovering short secret keys of RLCE in polynomial time2020-02-25Paper
Improvements of Algebraic Attacks for solving the Rank Decoding and MinRank problems2020-02-14Paper
Identifying an unknown code by partial Gaussian elimination2019-02-20Paper
Two attacks on rank metric code-based schemes: RankSign and an IBE scheme2018-12-20Paper
Quantum information set decoding algorithms2018-09-12Paper
Recovering short secret keys of RLCE in polynomial time2018-05-29Paper
CAKE: CODE-based algorithm for key encapsulation2018-04-20Paper
The action of a few random permutations on r-tuples and an application to cryptography2017-11-16Paper
Identity-based encryption from codes with rank metric2017-10-27Paper
Quantum Serial Turbo Codes2017-08-08Paper
A Distinguisher for High-Rate McEliece Cryptosystems2017-06-08Paper
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength2017-06-08Paper
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions2017-05-02Paper
Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups2017-04-28Paper
Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes2016-04-26Paper
An Efficient Attack on a Code-Based Signature Scheme2016-04-26Paper
RankSynd a PRNG Based on Rank Metric2016-04-26Paper
Structural cryptanalysis of McEliece schemes with compact keys2016-04-05Paper
A Polynomial-Time Attack on the BBCRS Scheme2015-08-27Paper
New identities relating wild Goppa codes2014-09-02Paper
Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes2014-08-18Paper
https://portal.mardi4nfdi.de/entity/Q54959512014-08-07Paper
Polynomial Time Attack on Wild McEliece over Quadratic Extensions2014-05-27Paper
An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes2013-06-14Paper
An Efficient Attack on All Concrete KKS Proposals2011-11-25Paper
Accurate estimates of the data complexity and success probability for various cryptanalyses2011-04-08Paper
Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes2011-02-19Paper
Ramanujan graphs of very large girth based on octonions2010-11-11Paper
Algebraic Cryptanalysis of McEliece Variants with Compact Keys2010-06-01Paper
https://portal.mardi4nfdi.de/entity/Q51882282010-03-10Paper
On Linear Cryptanalysis with Many Linear Approximations2010-01-07Paper
Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security2009-04-29Paper
Computing the Algebraic Immunity Efficiently2009-04-02Paper
The Gaussian Isoperimetric Inequality and Decoding Error Probabilities for the Gaussian Channel2008-12-21Paper
Collisions for the LPS Expander Graph Hash Function2008-04-15Paper
Generalized Alon--Boppana Theorems and Error-Correcting Codes2006-06-01Paper
Spectral estimates for abelian Cayley graphs2006-01-10Paper
Wave equations for graphs and the edge-based Laplacian2005-02-24Paper
New spectral lower bounds on the bisection width of graphs2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44742392004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q48010772003-04-06Paper
Discrete isoperimetric inequalities and the probability of a decoding error2003-01-13Paper
Laplacian eigenvalues and distances between subsets of a manifold2002-08-15Paper
https://portal.mardi4nfdi.de/entity/Q27666662002-07-22Paper
Edge isoperimetric inequalities for product graphs2001-04-26Paper
On the dual distance and the gap of a binary code2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q49544152000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49453572000-03-23Paper
https://portal.mardi4nfdi.de/entity/Q49406782000-03-01Paper
The action of a few permutations onr-tuples is quickly transitive1999-12-19Paper
The spectrum of de Bruijn and Kautz graphs1998-10-27Paper
Optimal Cycle Codes Constructed From Ramanujan Graphs1998-02-09Paper
Eigenvalues, eigenspaces and distances to subsets1998-01-22Paper
https://portal.mardi4nfdi.de/entity/Q42287421995-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55677461966-01-01Paper

Research outcomes over time

This page was built for person: Jean-Pierre Tillich