default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmmanuel Fouotsa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Emmanuel Fouotsa, Laurian Azebaze Guimagang, Raoul Ayissi:
x-superoptimal pairings on elliptic curves with odd prime embedding degrees: BW13-P310 and BW19-P286. Appl. Algebra Eng. Commun. Comput. 36(2): 153-171 (2025)- 2024
- [j11]Franck Rivel Kamwa Djomou
, Emmanuel Fouotsa, Tadmon Calvin:
Expanded low-rank parity-check codes and their application to cryptography. Cryptologia 48(4): 323-351 (2024) - [j10]Senegue Gomez Nyamsi, Emmanuel Fouotsa, Calvin Tcheka:
Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees k = 5,7. Discret. Math. Algorithms Appl. 16(5): 2350054:1-2350054:18 (2024) - [c6]Aubain Jose Mayeukeu, Emmanuel Fouotsa:
Same Values Analysis Attack on Weierstrass Binary Elliptic Curves. AFRICACRYPT 2024: 311-326 - [i13]Gustave Tchoffo Saah, Tako Boris Fouotsa, Emmanuel Fouotsa, Celestin Nkuimi Jugnia:
Avoiding Trusted Setup in Isogeny-based Commitments. IACR Cryptol. ePrint Arch. 2024: 531 (2024) - [i12]Senegue Gomez Nyamsi, Laurian Azebaze Guimagang, Emmanuel Fouotsa:
Accelerating pairings on BW10 and BW14 Curves. IACR Cryptol. ePrint Arch. 2024: 1017 (2024) - 2023
- [j9]Fouazou Lontouo Perez Broon, Emmanuel Fouotsa, Daniel Tieudjo:
Division polynomials on the Hessian model of elliptic curves. Appl. Algebra Eng. Commun. Comput. 34(1): 1-16 (2023) - [j8]Arnaud Girès Fobasso Tchinda, Emmanuel Fouotsa, Celestin Nkuimi Jugnia:
Sieve algorithms for some orthogonal integer lattices. Discret. Math. Algorithms Appl. 15(7): 2250151:1-2250151:15 (2023) - [j7]Arnaud Girès Fobasso Tchinda, Emmanuel Fouotsa, Celestin Nkuimi Jugnia:
A Polynomial Algorithm for Solving the Closest Vector Problem in Tensored Root Lattices of Type D. SN Comput. Sci. 4(1): 19 (2023) - 2022
- [j6]Laurian Azebaze Guimagang, Emmanuel Fouotsa, Nadia El Mrabet, Aminatou Pecha:
Faster Beta Weil Pairing on BLS Pairing Friendly Curves with Odd Embedding Degree. Math. Comput. Sci. 16(2-3): 13 (2022) - [c5]Nadia El Mrabet, Loubna Ghammam, Nicolas Méloni, Emmanuel Fouotsa:
New Versions of Miller-loop Secured Against Side-Channel Attacks. WAIFI 2022: 269-287 - [i11]Emmanuel Fouotsa, Laurian Azebaze Guimagang, Raoul Ayissi:
x-Superoptimal Pairings on some Elliptic Curves with Odd Prime Embedding Degrees. IACR Cryptol. ePrint Arch. 2022: 716 (2022) - [i10]Laurian Azebaze Guimagang, Emmanuel Fouotsa, Nadia El Mrabet, Aminatou Pecha:
Faster Beta Weil Pairing on BLS Pairing Friendly Curves with Odd Embedding Degree. IACR Cryptol. ePrint Arch. 2022: 769 (2022) - 2021
- [j5]Fouazou Lontouo Perez Broon, Thinh Dang, Emmanuel Fouotsa, Dustin Moody:
Isogenies on twisted Hessian curves. J. Math. Cryptol. 15(1): 345-358 (2021) - [i9]Hermann Tchatchiem Kamche, Hervé Talé Kalachi, Franck Rivel Kamwa Djomou, Emmanuel Fouotsa:
Low-Rank Parity-Check Codes Over Finite Commutative Rings and Application to Cryptography. CoRR abs/2106.08712 (2021) - 2020
- [j4]Narcisse Bang Mbang, Diego de Freitas Aranha, Emmanuel Fouotsa:
Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level. Int. J. Appl. Cryptogr. 4(1): 45-59 (2020) - [j3]Emmanuel Fouotsa, Laurian Azebaze Guimagang:
Fast Hashing to ${\mathbb {G}}_{2}$ on Aurifeuillean Pairing-Friendly Elliptic Curves. SN Comput. Sci. 1(1): 51 (2020) - [i8]Narcisse Bang Mbang, Emmanuel Fouotsa, Célestin Lélé:
Parallel Computation of Optimal Ate Cryptographic Pairings at the 128, 192 and 256-bit security levels using elliptic net algorithm. CoRR abs/2003.11286 (2020)
2010 – 2019
- 2019
- [i7]Abderrahmane Nitaj, Emmanuel Fouotsa:
A New Attack on RSA and Demytko's Elliptic Curve Cryptosystem. IACR Cryptol. ePrint Arch. 2019: 1050 (2019) - [i6]Fouazou Lontouo Perez Broon, Emmanuel Fouotsa:
Analogue of Vélu's Formulas for Computing Isogenies over Hessian Model of Elliptic Curves. IACR Cryptol. ePrint Arch. 2019: 1480 (2019) - 2018
- [c4]Nafissatou Diarra, Emmanuel Fouotsa:
An Encoding for the Theta Model of Elliptic Curves. InterSol 2018: 224-235 - 2016
- [j2]Emmanuel Fouotsa, Abdoul Aziz Ciss:
Faster Ate pairing computation on Selmer's model of elliptic curves. Groups Complex. Cryptol. 8(1): 55-67 (2016) - [c3]Loubna Ghammam, Emmanuel Fouotsa:
Adequate Elliptic Curves for Computing the Product of n Pairings. WAIFI 2016: 36-53 - [i5]Loubna Ghammam, Emmanuel Fouotsa:
On the Computation of the Optimal Ate Pairing at the 192-bit Security Level. IACR Cryptol. ePrint Arch. 2016: 130 (2016) - [i4]Loubna Ghammam, Emmanuel Fouotsa:
Adequate Elliptic Curve for Computing the Product of n Pairings. IACR Cryptol. ePrint Arch. 2016: 472 (2016) - [i3]Emmanuel Fouotsa, Nadia El Mrabet, Aminatou Pecha:
Optimal Ate Pairing on Elliptic Curves with Embedding Degree 9, 15 and 27. IACR Cryptol. ePrint Arch. 2016: 1187 (2016) - 2015
- [c2]Nadia El Mrabet, Emmanuel Fouotsa:
Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography. C2SI 2015: 259-273 - 2014
- [j1]Sylvain Duquesne, Nadia El Mrabet, Emmanuel Fouotsa:
Efficient computation of pairings on Jacobi quartic elliptic curves. J. Math. Cryptol. 8(4): 331-362 (2014) - 2013
- [i2]Sylvain Duquesne, Nadia El Mrabet, Emmanuel Fouotsa:
Efficient Pairings Computation on Jacobi Quartic Elliptic Curves. IACR Cryptol. ePrint Arch. 2013: 597 (2013) - 2012
- [c1]Sylvain Duquesne, Emmanuel Fouotsa:
Tate Pairing Computation on Jacobi's Elliptic Curves. Pairing 2012: 254-269 - [i1]Oumar Diao, Emmanuel Fouotsa:
Edwards model of elliptic curves defined over any fields. IACR Cryptol. ePrint Arch. 2012: 346 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-15 01:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
