The following pages link to Alain Couvreur (Q398977):
Displayed 41 items.
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes (Q398980) (← links)
- The dual minimum distance of arbitrary-dimensional algebraic-geometric codes (Q420711) (← links)
- Differential approach for the study of duals of algebraic-geometric codes on surfaces (Q449692) (← links)
- Construction of rational surfaces yielding good codes (Q640004) (← links)
- Sums of residues on algebraic surfaces and application to coding theory (Q734805) (← links)
- New identities relating wild Goppa codes (Q740309) (← links)
- Power error locating pairs (Q782853) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Towards a function field version of Freiman's theorem (Q1800656) (← links)
- Evaluation codes from smooth quadric surfaces and twisted Segre varieties (Q1934226) (← links)
- Decoding supercodes of Gabidulin codes and applications to cryptanalysis (Q2118521) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- On the security of a Loidreau rank metric code based encryption scheme (Q2200523) (← links)
- Recovering short secret keys of RLCE in polynomial time (Q2302130) (← links)
- On tensor products of CSS codes (Q2421732) (← links)
- An upper bound on the number of rational points of arbitrary projective varieties over finite fields (Q2814392) (← links)
- A Polynomial-Time Attack on the BBCRS Scheme (Q2941191) (← links)
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions (Q2979114) (← links)
- Anticanonical codes from del Pezzo surfaces with Picard rank one (Q3298967) (← links)
- Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes (Q3460457) (← links)
- Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes (Q4991378) (← links)
- Algebraic geometry codes and some applications (Q5013037) (← links)
- On the Security of Subspace Subcodes of Reed–Solomon Codes for Public Key Encryption (Q5030311) (← links)
- Recovering or Testing Extended-Affine Equivalence (Q5040013) (← links)
- Toward good families of codes from towers of surfaces (Q5043429) (← links)
- Sub-quadratic time for riemann-roch spaces (Q5145949) (← links)
- Incidence Structures From the Blown–Up Plane and LDPC Codes (Q5273540) (← links)
- A Construction of Quantum LDPC Codes From Cayley Graphs (Q5346348) (← links)
- Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes (Q5369878) (← links)
- Codes and the Cartier operator (Q5418515) (← links)
- Polynomial Time Attack on Wild McEliece over Quadratic Extensions (Q5418687) (← links)
- On codes and learning with errors over function fields (Q6104346) (← links)
- Correlated pseudorandomness from the hardness of quasi-abelian decoding (Q6190123) (← links)
- Practical algebraic attack on DAGS (Q6199260) (← links)
- Recovering short secret keys of RLCE in polynomial time (Q6302256) (← links)
- On the hardness of code equivalence problems in rank metric (Q6353343) (← links)
- Decoding supercodes of Gabidulin codes and applications to cryptanalysis (Q6362088) (← links)
- How arithmetic and geometry make error correcting codes better (Q6380970) (← links)
- A proof of the Brill-Noether method from scratch (Q6408937) (← links)
- Codes and modular curves (Q6422963) (← links)
- An extension of Overbeck's attack with an application to cryptanalysis of Twisted Gabidulin-based schemes (Q6435006) (← links)