My Github Projects

Follow this link for my github

Analysis dual lattice attack.

Analysis of the distinguisher at the heart of dual lattice attacks. Those calculations proves that we can predict the number of false-positives in a dual attacks and that a dual attack is possible contrary to what it is presumed in [Ducas,Pulles,2023]. This SageMaths implementation supports the paper "Reduction from sparse-LPN to LPN, Dual Attack 3.0".

SDitH security.

This SageMaths implementation measures the security level of SDitH Digital signature with our attack presented in "Projective Space Stern Decoding and Application to SDitH". It also provides some simulations to verify our analyses.

Coded Dual Attack.

An optimizer in Python to find the best parameter for our coded dual attack algorithm presented in "Assessing the Impact of a Varaint of the Latest Dual Attack".

Polar codes over Zq.

A C implementation of Polar Codes over the ring Z/qZ. Study of distortion properties of those codes.

About [BM18].

Simulations demonstrating that the analysis in [Both,May,2018] is incorrect, while the one in Appendix B of the paper "Statistical Decoding 2.0: Reducing Decoding to LPN" is accurate.

Decoding Cost.

This C++ implementation is carried out as part of the ANR DECODE project. It allows to calculate the optimal parameters of the most popular decoders. For the most recent decoders, finding the optimal parameters is a relatively complex numerical optimization problem. This includes a corrected analysis of [Both,May,2018] ISD algorithm. This algorithm is the state-of-the-art of generic decoders. However, the original analysis turns out to be wrong. Thus, these calculations shows that instead of gaining 8% on the complexity of the previous decoder, we ultimately gain almost nothing. The results that have been calculated by this implementation are presented in the Appendix B of the paper "Statistical Decoding 2.0: Reducing Decoding to LPN".