The following pages link to Jean-Pierre Tillich (Q264130):
Displaying 50 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes (Q398980) (← links)
- (Q596082) (redirect page) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (Q626942) (← links)
- New identities relating wild Goppa codes (Q740309) (← links)
- The spectrum of de Bruijn and Kautz graphs (Q1266388) (← links)
- (Q1356740) (redirect page) (← links)
- Eigenvalues, eigenspaces and distances to subsets (Q1356741) (← links)
- On the dual distance and the gap of a binary code (Q1584453) (← links)
- Laplacian eigenvalues and distances between subsets of a manifold (Q1609803) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Quantum information set decoding algorithms (Q1673589) (← links)
- Identity-based encryption from codes with rank metric (Q1675201) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- CAKE: CODE-based algorithm for key encapsulation (Q1744856) (← links)
- Wave equations for graphs and the edge-based Laplacian (Q1764371) (← links)
- Edge isoperimetric inequalities for product graphs (Q1970722) (← links)
- An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes (Q2181873) (← links)
- Recovering short secret keys of RLCE in polynomial time (Q2302130) (← links)
- Accurate estimates of the data complexity and success probability for various cryptanalyses (Q2430686) (← links)
- Spectral estimates for abelian Cayley graphs (Q2581503) (← links)
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems (Q2692353) (← links)
- On the dimension and structure of the square of the dual of a Goppa code (Q2697482) (← links)
- Discrete Isoperimetric Inequalities and the Probability of a Decoding Error (Q2709849) (← links)
- (Q2766666) (← links)
- RankSynd a PRNG Based on Rank Metric (Q2802599) (← links)
- An Efficient Attack on a Code-Based Signature Scheme (Q2802609) (← links)
- Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes (Q2802612) (← links)
- A Polynomial-Time Attack on the BBCRS Scheme (Q2941191) (← links)
- Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups (Q2977045) (← links)
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions (Q2979114) (← links)
- An Efficient Attack on All Concrete KKS Proposals (Q3102786) (← links)
- The Gaussian Isoperimetric Inequality and Decoding Error Probabilities for the Gaussian Channel (Q3547709) (← links)
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys (Q3563840) (← links)
- Computing the Algebraic Immunity Efficiently (Q3618664) (← links)
- Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security (Q3623044) (← links)
- On Linear Cryptanalysis with Many Linear Approximations (Q3654615) (← links)
- (Q4228742) (← links)
- Optimal Cycle Codes Constructed From Ramanujan Graphs (Q4377442) (← links)
- (Q4474239) (← links)
- The action of a few random permutations on r-tuples and an application to cryptography (Q4593946) (← links)
- The action of a few permutations onr-tuples is quickly transitive (Q4705319) (← links)
- (Q4801077) (← links)
- An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes (Q4928591) (← links)
- (Q4940678) (← links)
- (Q4945357) (← links)
- (Q4954415) (← links)
- Quantum Serial Turbo Codes (Q4975896) (← links)
