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

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

Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition. - Youssef El Housni; Aurore Guillevic (CANS, 2020)

Co-factor Clearing and Subgroup Membership Testing on Pairing-Friendly Curves. - Youssef El Housni; Aurore Guillevic; Thomas Piellard (AFRICACRYPT, 2022)

Families of SNARK-Friendly 2-Chains of Elliptic Curves. - Youssef El Housni; Aurore Guillevic (EUROCRYPT (2), 2022)

A survey of elliptic curves for proof systems. - Diego F. Aranha; Youssef El Housni; Aurore Guillevic (IACR Cryptol. ePrint Arch., 2022)

EdMSM: Multi-Scalar-Multiplication for recursive SNARKs and more. - Youssef El Housni; Gautam Botrel (IACR Cryptol. ePrint Arch., 2022)

The Arithmetic of Pairing-Based Proof Systems. (L'arithmétique des systèmes de preuves basées sur les couplages). - Youssef El Housni (2022)

Pairings in Rank-1 Constraint Systems. - Youssef El Housni (ACNS (1), 2023)

Faster Montgomery multiplication and Multi-Scalar-Multiplication for SNARKs. - Gautam Botrel; Youssef El Housni (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023)

Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves. - Antonio Sanso; Youssef El Housni (J. Cryptol., 2024)

Fast Elliptic Curve Scalar Multiplications in SN(T)ARK Circuits. - Liam Eagen; Youssef El Housni; Simon Masson; Thomas Piellard (LATINCRYPT, 2025)

Batch subgroup membership testing on pairing-friendly curves. - Dimitri Koshelev; Youssef El Housni; Georgios Fotiadis (IACR Cryptol. ePrint Arch., 2025)