Valerie Gilchrist
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Valerie Gilchrist has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Christophe Petit
Universite Libre de Bruxelles
2 shared publications - Anaëlle Le Dévéhat
Inria and Laboratoire d’Informatique de l’Ecole polytechnique, Institut Polytechnique de Paris
1 shared publication - Benjamin Smith
Inria and Laboratoire d’Informatique de l’Ecole polytechnique, Institut Polytechnique de Paris
1 shared publication Christophe Petit
Universite Libre de Bruxelles
1 shared publicationDamien Robert
Inria Bordeaux, Institut de Mathématiques de Bordeaux
1 shared publicationGang Tang
University of Birmingham
1 shared publication
Latest Publications
- Open Access
- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
On the security of two blind signatures from code equivalence problems
The Linear Code Equivalence (LCE) problem and the Matrix Code Equivalence (MCE) problem are two examples of code-based hard problems that have gained attention as candidates for use in post-quantum cryptography. They are straightforward to implement, can be viewed as group actions, and offer a good trade-off between compactness and performance in the realm of post-quantum group actions. With the community gaining confidence in the security of these problems, new variants of these problems have been introduced to achieve particular functionalities in advanced protocols or efficiency improvements. A natural question is then whether the problem variants are as secure as the original ones. In this work, we consider three problem variants of LCE or MCE. We first consider a variant based on LCE, and reduce it to the original LCE assumption. This problem was presented in a prior version of the blind signature scheme, proposed by Duong, Khuc, Qiao, Susilo and Zhang. Second, we analyse an MCE variant, MIMCE, proposed in the context of another blind signature scheme, by Kutcha, Legrow and Persichetti, and show that the parameters proposed are not sufficient to reach the claimed bit security. Finally, we consider a multi-sample version of MIMCE which we solve in polynomial time.
- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
Open AccessOn the security of two blind signatures from code equivalence problems
The Linear Code Equivalence (LCE) problem and the Matrix Code Equivalence (MCE) problem are two examples of code-based hard problems that have gained attention as candidates for use in post-quantum cryptography. They are straightforward to implement, can be viewed as group actions, and offer a good trade-off between compactness and performance in the realm of post-quantum group actions. With the community gaining confidence in the security of these problems, new variants of these problems have been introduced to achieve particular functionalities in advanced protocols or efficiency improvements. A natural question is then whether the problem variants are as secure as the original ones. In this work, we consider three problem variants of LCE or MCE. We first consider a variant based on LCE, and reduce it to the original LCE assumption. This problem was presented in a prior version of the blind signature scheme, proposed by Duong, Khuc, Qiao, Susilo and Zhang. Second, we analyse an MCE variant, MIMCE, proposed in the context of another blind signature scheme, by Kutcha, Legrow and Persichetti, and show that the parameters proposed are not sufficient to reach the claimed bit security. Finally, we consider a multi-sample version of MIMCE which we solve in polynomial time.
- 2 October 2025
- Published by Springer Nature
- p. 174-208
Improved Algorithms for Ascending Isogeny Volcanoes, and Applications
- 2 October 2025
- Published by Springer Nature
- p. 174-208
Improved Algorithms for Ascending Isogeny Volcanoes, and Applications
- Open Access
- 7 October 2024
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (3)
Attacking trapdoors from matrix products
Recently, Geraud-Stewart and Naccache proposed two trapdoors based on matrix products. In this paper, we answer the call for cryptanalysis. We explore how using the trace and determinant of a matrix can be used to attack their constructions. We fully break their first construction in a polynomial-time attack. We show an information leak in the second construction using characteristic polynomials, and provide two attacks that decrease the bit security by about half.
- 7 October 2024
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (3)
Open AccessAttacking trapdoors from matrix products
Recently, Geraud-Stewart and Naccache proposed two trapdoors based on matrix products. In this paper, we answer the call for cryptanalysis. We explore how using the trace and determinant of a matrix can be used to attack their constructions. We fully break their first construction in a polynomial-time attack. We show an information leak in the second construction using characteristic polynomials, and provide two attacks that decrease the bit security by about half.
- 26 September 2023
- Published by Springer Nature
- p. 129-148
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields
- 26 September 2023
- Published by Springer Nature
- p. 129-148
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields