default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaire Delaplace
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Damien Vidal, Claire Delaplace, Sorina Ionica:
An analysis of the Crossbred Algorithm for the MQ Problem. IACR Commun. Cryptol. 1(3): 36 (2024)- [i6]Damien Vidal, Sorina Ionica, Claire Delaplace:
The Complexity of the Crossbred Algorithm. IACR Cryptol. ePrint Arch. 2024: 992 (2024) - 2022
- [c7]Charles Bouillaguet, Claire Delaplace, Monika Trimoska:
A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over F2. SOSA 2022: 285-296 - 2021
- [j3]Mellila Bouam, Charles Bouillaguet
, Claire Delaplace, Camille Noûs:
Computational records with aging hardware: Controlling half the output of SHA-256. Parallel Comput. 106: 102804 (2021) - [i5]Mellila Bouam, Charles Bouillaguet, Claire Delaplace, Camille Noûs:
Computational Records with Aging Hardware: Controlling Half the Output of SHA-256. IACR Cryptol. ePrint Arch. 2021: 886 (2021) - [i4]Charles Bouillaguet, Claire Delaplace, Monika Trimoska:
A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over 픽2. IACR Cryptol. ePrint Arch. 2021: 1639 (2021) - 2020
- [j2]Claire Delaplace, Alexander May:
Can we Beat the Square Root Bound for ECDLP over 𝔽p2 via Representation? J. Math. Cryptol. 14(1): 293-306 (2020)
2010 – 2019
- 2019
- [c6]Claire Delaplace, Andre Esser, Alexander May:
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions. IMACC 2019: 178-199 - [i3]Claire Delaplace, Alexander May:
Can we Beat the Square Root Bound for ECDLP over Fp2 via Representations? IACR Cryptol. ePrint Arch. 2019: 800 (2019) - [i2]Claire Delaplace, Andre Esser, Alexander May:
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions. IACR Cryptol. ePrint Arch. 2019: 804 (2019) - 2018
- [b1]Claire Delaplace:
Linear algebra algorithms for cryptography. (Algorithmes d'algèbre linéaire pour la cryptographie). University of Rennes 1, France, 2018 - [j1]Charles Bouillaguet, Claire Delaplace, Pierre-Alain Fouque:
Revisiting and Improving Algorithms for the 3XOR Problem. IACR Trans. Symmetric Cryptol. 2018(1): 254-276 (2018) - [c5]Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque, Mehdi Tibouchi:
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. ASIACRYPT (1) 2018: 494-524 - [c4]Bonan Cuan, Aliénor Damien, Claire Delaplace, Mathieu Valois:
Malware Detection in PDF Files using Machine Learning. ICETE (2) 2018: 578-585 - [i1]Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque, Mehdi Tibouchi:
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. IACR Cryptol. ePrint Arch. 2018: 822 (2018) - 2017
- [c3]Charles Bouillaguet, Claire Delaplace, Marie-Emilie Voge:
Parallel Sparse PLUQ Factorization modulo p. PASCO@ISSAC 2017: 8:1-8:10 - [c2]Charles Bouillaguet, Claire Delaplace, Pierre-Alain Fouque, Paul Kirchner:
Fast Lattice-Based Encryption: Stretching Spring. PQCrypto 2017: 125-142 - 2016
- [c1]Charles Bouillaguet, Claire Delaplace:
Sparse Gaussian Elimination Modulo p: An Update. CASC 2016: 101-116
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 2024-10-30 20:29 CET 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:
