| Publication | Date of Publication | Type |
|---|
Decoding rank metric Reed-Muller codes
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
| Highway to Hull: an algorithm for solving the general matrix code equivalence problem | 2026-02-04 | Paper |
| FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits | 2025-07-03 | Paper |
| MinRank Gabidulin encryption scheme on matrix codes | 2025-07-03 | Paper |
| On the structure of the Schur squares of twisted generalized Reed-Solomon codes and application to cryptanalysis | 2025-06-20 | Paper |
Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
Applicable Algebra in Engineering, Communication and Computing | 2024-11-01 | Paper |
| A new approach based on quadratic forms to attack the McEliece cryptosystem | 2024-09-13 | Paper |
| Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography | 2024-08-30 | Paper |
Practical algebraic attack on DAGS
Code-Based Cryptography | 2024-02-23 | Paper |
Correlated pseudorandomness from the hardness of quasi-abelian decoding
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
On codes and learning with errors over function fields
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
An extension of Overbeck's attack with an application to cryptanalysis of Twisted Gabidulin-based schemes
(available as arXiv preprint) | 2023-05-02 | Paper |
| Codes and modular curves | 2023-01-09 | Paper |
Toward good families of codes from towers of surfaces
Contemporary Mathematics | 2022-10-21 | Paper |
Recovering or Testing Extended-Affine Equivalence
IEEE Transactions on Information Theory | 2022-10-11 | Paper |
Computing Riemann-Roch spaces via Puiseux expansions
Journal of Complexity | 2022-09-12 | Paper |
| A proof of the Brill-Noether method from scratch | 2022-08-26 | Paper |
Decoding supercodes of Gabidulin codes and applications to cryptanalysis
(available as arXiv preprint) | 2022-03-22 | Paper |
On the Security of Subspace Subcodes of Reed–Solomon Codes for Public Key Encryption
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Algebraic geometry codes and some appliations
(available as arXiv preprint) | 2021-11-26 | Paper |
| How arithmetic and geometry make error correcting codes better | 2021-10-21 | Paper |
Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
SIAM Journal on Applied Algebra and Geometry | 2021-06-03 | Paper |
Decoding supercodes of Gabidulin codes and applications to cryptanalysis
(available as arXiv preprint) | 2021-03-03 | Paper |
Sub-quadratic time for riemann-roch spaces
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
| On the hardness of code equivalence problems in rank metric | 2020-11-09 | Paper |
On the security of a Loidreau rank metric code based encryption scheme
Designs, Codes and Cryptography | 2020-09-22 | Paper |
Power error locating pairs
Designs, Codes and Cryptography | 2020-07-29 | Paper |
Anticanonical codes from del Pezzo surfaces with Picard rank one
Transactions of the American Mathematical Society | 2020-07-17 | Paper |
Recovering short secret keys of RLCE in polynomial time
(available as arXiv preprint) | 2020-02-25 | Paper |
On tensor products of CSS codes
Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) | 2019-06-18 | Paper |
An efficient structural attack on NIST submission DAGS
(available as arXiv preprint) | 2018-12-20 | Paper |
Towards a function field version of Freiman's theorem
Algebraic Combinatorics | 2018-10-24 | Paper |
Recovering short secret keys of RLCE in polynomial time
(available as arXiv preprint) | 2018-05-29 | Paper |
Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
IEEE Transactions on Information Theory | 2017-10-19 | Paper |
Incidence Structures From the Blown–Up Plane and LDPC Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
A Construction of Quantum LDPC Codes From Cayley Graphs
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
An upper bound on the number of rational points of arbitrary projective varieties over finite fields
Proceedings of the American Mathematical Society | 2016-06-22 | Paper |
Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
Coding Theory and Applications | 2016-01-07 | Paper |
A Polynomial-Time Attack on the BBCRS Scheme
Lecture Notes in Computer Science | 2015-08-27 | Paper |
New identities relating wild Goppa codes
Finite Fields and their Applications | 2014-09-02 | Paper |
Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
Designs, Codes and Cryptography | 2014-08-18 | Paper |
Codes and the cartier operator
Proceedings of the American Mathematical Society | 2014-06-04 | Paper |
Polynomial time attack on wild McEliece over quadratic extensions
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Evaluation codes from smooth quadric surfaces and twisted Segre varieties
Designs, Codes and Cryptography | 2013-01-28 | Paper |
Differential approach for the study of duals of algebraic-geometric codes on surfaces
Journal de Théorie des Nombres de Bordeaux | 2012-08-31 | Paper |
Differential approach for the study of duals of algebraic-geometric codes on surfaces
Journal de Théorie des Nombres de Bordeaux | 2012-08-31 | Paper |
The dual minimum distance of arbitrary-dimensional algebraic-geometric codes
Journal of Algebra | 2012-05-23 | Paper |
Construction of rational surfaces yielding good codes
Finite Fields and their Applications | 2011-10-12 | Paper |
Sums of residues on algebraic surfaces and application to coding theory
Journal of Pure and Applied Algebra | 2009-10-13 | Paper |
