default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValerie Gilchrist
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j2]Valerie Gilchrist
, Laurane Marco, Christophe Petit, Gang Tang:
On the security of two blind signatures from code equivalence problems. IACR Commun. Cryptol. 2(4): 27 (2026)- [c4]Paul Frixons, Valerie Gilchrist, Péter Kutas, Simon-Philipp Merz, Christophe Petit, Lam L. Pham:
Another Look at the Quantum Security of the Vectorization Problem with Shifted Inputs. EUROCRYPT (1) 2026: 633-662 - 2025
- [c3]Steven D. Galbraith, Valerie Gilchrist, Damien Robert:
Improved Algorithms for Ascending Isogeny Volcanoes, and Applications. LATINCRYPT 2025: 174-208 - [i9]Paul Frixons, Valerie Gilchrist, Péter Kutas, Simon-Philipp Merz, Christophe Petit:
Another Look at the Quantum Security of the Vectorization Problem with Shifted Inputs. IACR Cryptol. ePrint Arch. 2025: 376 (2025) - [i8]Steven D. Galbraith, Valerie Gilchrist, Damien Robert:
Improving special cases of the computational isogeny problem. IACR Cryptol. ePrint Arch. 2025: 1243 (2025) - [i7]Valerie Gilchrist, Laurane Marco, Christophe Petit, Gang Tang:
On the security of two blind signatures from code equivalence problems. IACR Cryptol. ePrint Arch. 2025: 1883 (2025) - 2024
- [j1]Thomas Decru, Tako Boris Fouotsa, Paul Frixons, Valerie Gilchrist, Christophe Petit:
Attacking trapdoors from matrix products. IACR Commun. Cryptol. 1(3): 43 (2024) - [c2]Valerie Gilchrist, Laurane Marco, Christophe Petit, Gang Tang:
Solving the Tensor Isomorphism Problem for Special Orbits with Low Rank Points: Cryptanalysis and Repair of an Asiacrypt 2023 Commitment Scheme. CRYPTO (1) 2024: 141-173 - [i6]Valerie Gilchrist, Laurane Marco, Christophe Petit, Gang Tang:
Solving the Tensor Isomorphism Problem for special orbits with low rank points: Cryptanalysis and repair of an Asiacrypt 2023 commitment scheme. IACR Cryptol. ePrint Arch. 2024: 337 (2024) - [i5]Thomas Decru, Tako Boris Fouotsa, Paul Frixons, Valerie Gilchrist, Christophe Petit:
Attacking trapdoors from matrix products. IACR Cryptol. ePrint Arch. 2024: 1332 (2024) - [i4]Steven D. Galbraith, Valerie Gilchrist, Shai Levin, Ari Markowitz:
Further Connections Between Isogenies of Supersingular Curves and Bruhat-Tits Trees. IACR Cryptol. ePrint Arch. 2024: 1971 (2024) - 2023
- [c1]Gustavo Banegas, Valerie Gilchrist, Anaëlle Le Dévéhat, Benjamin Smith:
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields. LATINCRYPT 2023: 129-148 - [i3]Gustavo Banegas, Valerie Gilchrist, Anaëlle Le Dévéhat, Benjamin Smith:
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields. CoRR abs/2306.16072 (2023) - [i2]Gustavo Banegas, Valerie Gilchrist, Anaëlle Le Dévéhat, Benjamin Smith:
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields. IACR Cryptol. ePrint Arch. 2023: 995 (2023) - 2022
- [i1]Gustavo Banegas, Valerie Gilchrist, Benjamin Smith:
Efficient supersingularity testing over 픽p and CSIDH key validation. IACR Cryptol. ePrint Arch. 2022: 880 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-05 02:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
