Claire Delaplace

According to our database1, Claire Delaplace authored at least 13 papers between 2016 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over F<sub>2</sub>.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

2021
Computational records with aging hardware: Controlling half the output of SHA-256.
Parallel Comput., 2021

A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over 픽<sub>2</sub>.
IACR Cryptol. ePrint Arch., 2021

2020
Can we Beat the Square Root Bound for ECDLP over 𝔽<sub>p<sup>2</sup></sub> via Representation?
J. Math. Cryptol., 2020

2019
Can we Beat the Square Root Bound for ECDLP over F<sub>p<sup>2</sup></sub> via Representations?
IACR Cryptol. ePrint Arch., 2019

Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions.
IACR Cryptol. ePrint Arch., 2019

2018
Linear algebra algorithms for cryptography. (Algorithmes d'algèbre linéaire pour la cryptographie).
PhD thesis, 2018

Revisiting and Improving Algorithms for the 3XOR Problem.
IACR Trans. Symmetric Cryptol., 2018

LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS.
IACR Cryptol. ePrint Arch., 2018

Malware Detection in PDF Files using Machine Learning.
Proceedings of the 15th International Joint Conference on e-Business and Telecommunications, 2018

2017
Fast Lattice-Based Encryption: Stretching Spring.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

Parallel Sparse PLUQ Factorization modulo p.
Proceedings of the International Workshop on Parallel Symbolic Computation, 2017

2016
Sparse Gaussian Elimination Modulo p: An Update.
Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016


  Loading...