| Publication | Date of Publication | Type |
|---|
On linear equivalence, canonical forms, and digital signatures
Designs, Codes and Cryptography | 2025-08-11 | Paper |
| Polynomial inversion algorithms in constant time for post-quantum cryptography | 2025-07-23 | Paper |
A guide to the design of digital signatures based on cryptographic group actions
Journal of Cryptology | 2025-07-10 | Paper |
| On the semidirect discrete logarithm problem in finite groups | 2025-07-03 | Paper |
| Enhancing threshold group action signature schemes: adaptive security and scalability improvements | 2025-06-20 | Paper |
A new path to code-based signatures via identification schemes with restricted errors
Advances in Mathematics of Communications | 2025-05-21 | Paper |
| Cutting the GRASS: threshold group action signature schemes | 2024-11-12 | Paper |
| A new formulation of the linear equivalence problem and shorter less signatures | 2024-08-30 | Paper |
DAGS: reloaded revisiting dyadic key encapsulation
Code-Based Cryptography | 2024-02-23 | Paper |
Take your MEDS: digital signatures from matrix code equivalence
Progress in Cryptology - AFRICACRYPT 2023 | 2024-02-02 | Paper |
On the hardness of the Lee syndrome decoding problem
Advances in Mathematics of Communications | 2023-12-14 | Paper |
On the computational hardness of the code equivalence problem in cryptography
Advances in Mathematics of Communications | 2023-07-07 | Paper |
An attack on a non-interactive key exchange from code equivalence
Tatra Mountains Mathematical Publications | 2023-02-21 | Paper |
| On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography | 2023-01-18 | Paper |
LESS is more: code-based signatures without syndromes
Progress in Cryptology - AFRICACRYPT 2020 | 2022-11-09 | Paper |
| Security analysis of a cryptosystem based on subspace subcodes | 2022-08-11 | Paper |
| LESS-FM: fine-tuning signatures from the code equivalence problem | 2022-03-22 | Paper |
Reproducible families of codes and cryptographic applications
Journal of Mathematical Cryptology | 2021-11-05 | Paper |
Cryptanalysis of a code-based full-time signature
Designs, Codes and Cryptography | 2021-09-06 | Paper |
| Improvement of binary and non binary statistical decoding algorithm | 2020-07-08 | Paper |
Designing efficient dyadic operations for cryptographic applications
Journal of Mathematical Cryptology | 2020-06-24 | Paper |
| Tighter proofs of CCA security in the quantum random oracle model | 2020-04-30 | Paper |
| A reaction attack against cryptosystems based on LRPC codes | 2020-01-14 | Paper |
Code-Based Key Encapsulation from McEliece’s Cryptosystem
Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | Paper |
DAGS: key encapsulation using dyadic GS codes
Journal of Mathematical Cryptology | 2019-01-11 | Paper |
| On the CCA2 security of McEliece in the standard model | 2018-11-07 | Paper |
| CAKE: CODE-based algorithm for key encapsulation | 2018-04-20 | Paper |
On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
International Journal of Information and Coding Theory | 2017-07-26 | Paper |
Efficient implementation of hybrid encryption from coding theory
Codes, Cryptology and Information Security | 2017-06-01 | Paper |
Leakage-resilient cryptography over large finite fields: theory and practice
Applied Cryptography and Network Security | 2016-03-10 | Paper |
Secure and anonymous hybrid encryption from coding theory
Post-Quantum Cryptography | 2013-06-14 | Paper |
Compact McEliece keys based on quasi-dyadic Srivastava codes
Journal of Mathematical Cryptology | 2012-11-23 | Paper |
Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
