Publications

Youssef El Housni (2026). Fast cube roots in Fp2 via the algebraic torus. Pre-print.

Dimitri Koshelev, Youssef El Housni, Georgios Fotiadis (2025). Batch subgroup membership testing on pairing-friendly curves. Pre-print.

Liam Eagen, Youssef El Housni, Simon Masson, Thomas Piellard (2025). Fast elliptic curve scalar multiplications in SN(T)ARK circuits. LATINCRYPT 2025.

Antonio Sanso, Youssef El Housni (2023). Families of prime-order endomorphism-equipped embedded curves on pairing-friendly curves. Journal of Cryptology 2024.

Youssef El Housni (2022). The arithmetic of pairing-based proof systems. PhD dissertation.

Gautam Botrel, Youssef El Housni (2022). Faster Montgomery multiplication and Multi-Scalar-Multiplication for SNARKs. TCHES2023.

Youssef El Housni (2022). Pairings in Rank-1 Constraint System. ACNS2023.

Diego F. Aranha, Youssef El Housni, Aurore Guillevic (2022). A survey of elliptic curves for proof systems. DCC2022.

Youssef El Housni, Aurore Guillevic, Thomas Piellard (2022). Co-factor clearing and subgroup membership testing on pairing-friendly curves. AFRICACRYPT 2022.

Youssef El Housni, Aurore Guillevic (2022). Families of SNARK-friendly 2-chains of elliptic curves. EUROCRYPT 2022.

Youssef El Housni, Aurore Guillevic (2020). Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition. CANS2020.

Jean-Luc Danger, Youssef El Housni, Adrien Facon, Cheikh T. Gueye, Sylvain Guilley, Sylvie Herbel, Ousmane Ndiaye, Edoardo Persichetti, Alexander Schaub (2018). On the Performance and Security of Multiplication in $GF(2^N)$. MDPI2018.

Sylvain Guilley, Youssef El Housni (2018). Random Numbers Generation: Tests and Attacks. FDTC2018.