Tate Pairing Computation on Jacobi's Elliptic Curves. - Sylvain Duquesne; Emmanuel Fouotsa (Pairing, 2012)

Edwards model of elliptic curves defined over any fields. - Oumar Diao; Emmanuel Fouotsa (IACR Cryptol. ePrint Arch., 2012)

Efficient Pairings Computation on Jacobi Quartic Elliptic Curves. - Sylvain Duquesne; Nadia El Mrabet; Emmanuel Fouotsa (IACR Cryptol. ePrint Arch., 2013)

Efficient computation of pairings on Jacobi quartic elliptic curves. - Sylvain Duquesne; Nadia El Mrabet; Emmanuel Fouotsa (J. Math. Cryptol., 2014)

Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography. - Nadia El Mrabet; Emmanuel Fouotsa (C2SI, 2015)

Adequate Elliptic Curves for Computing the Product of n Pairings. - Loubna Ghammam; Emmanuel Fouotsa (WAIFI, 2016)

Faster Ate pairing computation on Selmer's model of elliptic curves. - Emmanuel Fouotsa; Abdoul Aziz Ciss (Groups Complex. Cryptol., 2016)

Optimal Ate Pairing on Elliptic Curves with Embedding Degree 9, 15 and 27. - Emmanuel Fouotsa; Nadia El Mrabet; Aminatou Pecha (IACR Cryptol. ePrint Arch., 2016)

On the Computation of the Optimal Ate Pairing at the 192-bit Security Level. - Loubna Ghammam; Emmanuel Fouotsa (IACR Cryptol. ePrint Arch., 2016)

Adequate Elliptic Curve for Computing the Product of n Pairings. - Loubna Ghammam; Emmanuel Fouotsa (IACR Cryptol. ePrint Arch., 2016)

An Encoding for the Theta Model of Elliptic Curves. - Nafissatou Diarra; Emmanuel Fouotsa (InterSol, 2018)

Analogue of Vélu's Formulas for Computing Isogenies over Hessian Model of Elliptic Curves. - Fouazou Lontouo Perez Broon; Emmanuel Fouotsa (IACR Cryptol. ePrint Arch., 2019)

A New Attack on RSA and Demytko's Elliptic Curve Cryptosystem. - Abderrahmane Nitaj; Emmanuel Fouotsa (IACR Cryptol. ePrint Arch., 2019)

Parallel Computation of Optimal Ate Cryptographic Pairings at the 128, 192 and 256-bit security levels using elliptic net algorithm. - Narcisse Bang Mbang; Emmanuel Fouotsa; Célestin Lélé (CoRR, 2020)

Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level. - Narcisse Bang Mbang; Diego de Freitas Aranha; Emmanuel Fouotsa (Int. J. Appl. Cryptogr., 2020)

Fast Hashing to ${ mathbb {G}}_{2}$ on Aurifeuillean Pairing-Friendly Elliptic Curves. - Emmanuel Fouotsa; Laurian Azebaze Guimagang (SN Comput. Sci., 2020)

Low-Rank Parity-Check Codes Over Finite Commutative Rings and Application to Cryptography. - Hermann Tchatchiem Kamche; Hervé Talé Kalachi; Franck Rivel Kamwa Djomou; Emmanuel Fouotsa (CoRR, 2021)

Isogenies on twisted Hessian curves. - Fouazou Lontouo Perez Broon; Thinh Dang; Emmanuel Fouotsa; Dustin Moody (J. Math. Cryptol., 2021)

New Versions of Miller-loop Secured Against Side-Channel Attacks. - Nadia El Mrabet; Loubna Ghammam; Nicolas Méloni; Emmanuel Fouotsa (WAIFI, 2022)

x-Superoptimal Pairings on some Elliptic Curves with Odd Prime Embedding Degrees. - Emmanuel Fouotsa; Laurian Azebaze Guimagang; Raoul Ayissi (IACR Cryptol. ePrint Arch., 2022)

Faster Beta Weil Pairing on BLS Pairing Friendly Curves with Odd Embedding Degree. - Laurian Azebaze Guimagang; Emmanuel Fouotsa; Nadia El Mrabet; Aminatou Pecha (Math. Comput. Sci., 2022)

Division polynomials on the Hessian model of elliptic curves. - Fouazou Lontouo Perez Broon; Emmanuel Fouotsa; Daniel Tieudjo (Appl. Algebra Eng. Commun. Comput., 2023)

A Polynomial Algorithm for Solving the Closest Vector Problem in Tensored Root Lattices of Type D. - Arnaud Girès Fobasso Tchinda; Emmanuel Fouotsa; Celestin Nkuimi Jugnia (SN Comput. Sci., 2023)

Sieve algorithms for some orthogonal integer lattices. - Arnaud Girès Fobasso Tchinda; Emmanuel Fouotsa; Celestin Nkuimi Jugnia (Discret. Math. Algorithms Appl., 2023)

Same Values Analysis Attack on Weierstrass Binary Elliptic Curves. - Aubain Jose Mayeukeu; Emmanuel Fouotsa (AFRICACRYPT, 2024)

Accelerating pairings on BW10 and BW14 Curves. - Senegue Gomez Nyamsi; Laurian Azebaze Guimagang; Emmanuel Fouotsa (IACR Cryptol. ePrint Arch., 2024)

Expanded low-rank parity-check codes and their application to cryptography. - Franck Rivel Kamwa Djomou; Emmanuel Fouotsa; Tadmon Calvin (Cryptologia, 2024)

Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees k = 5,7. - Senegue Gomez Nyamsi; Emmanuel Fouotsa; Calvin Tcheka (Discret. Math. Algorithms Appl., 2024)

Fast Final Exponentiation on BW and BLS Curves with Even Embedding Degrees at 128 bits security. - Senegue Gomez Nyamsi; Emmanuel Fouotsa; Calvin Tcheka (IACR Cryptol. ePrint Arch., 2025)

x-superoptimal pairings on elliptic curves with odd prime embedding degrees: BW13-P310 and BW19-P286. - Emmanuel Fouotsa; Laurian Azebaze Guimagang; Raoul Ayissi (Appl. Algebra Eng. Commun. Comput., 2025)

Avoiding trusted setup in isogeny-based commitments. - Gustave Tchoffo Saah; Tako Boris Fouotsa; Emmanuel Fouotsa; Celestin Nkuimi Jugnia (Des. Codes Cryptogr., 2025)

Low-rank parity-check codes over finite commutative rings. - Hermann Tchatchiem Kamche; Hervé Talé Kalachi; Franck Rivel Kamwa Djomou; Emmanuel Fouotsa (Appl. Algebra Eng. Commun. Comput., 2025)