Emmanuel Fouotsa

Orcid: 0000-0002-7729-0419

According to our database1, Emmanuel Fouotsa authored at least 29 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees k = 5,7.
Discret. Math. Algorithms Appl., July, 2024

Expanded low-rank parity-check codes and their application to cryptography.
Cryptologia, July, 2024

Avoiding Trusted Setup in Isogeny-based Commitments.
IACR Cryptol. ePrint Arch., 2024

Accelerating pairings on BW10 and BW14 Curves.
IACR Cryptol. ePrint Arch., 2024

Same Values Analysis Attack on Weierstrass Binary Elliptic Curves.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2024, 2024

2023
Sieve algorithms for some orthogonal integer lattices.
Discret. Math. Algorithms Appl., October, 2023

A Polynomial Algorithm for Solving the Closest Vector Problem in Tensored Root Lattices of Type D.
SN Comput. Sci., 2023

Division polynomials on the Hessian model of elliptic curves.
Appl. Algebra Eng. Commun. Comput., 2023

2022
Faster Beta Weil Pairing on BLS Pairing Friendly Curves with Odd Embedding Degree.
Math. Comput. Sci., 2022

x-Superoptimal Pairings on some Elliptic Curves with Odd Prime Embedding Degrees.
IACR Cryptol. ePrint Arch., 2022

New Versions of Miller-loop Secured Against Side-Channel Attacks.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

2021
Isogenies on twisted Hessian curves.
J. Math. Cryptol., 2021

Low-Rank Parity-Check Codes Over Finite Commutative Rings and Application to Cryptography.
CoRR, 2021

2020
Fast Hashing to ${\mathbb {G}}_{2}$ on Aurifeuillean Pairing-Friendly Elliptic Curves.
SN Comput. Sci., 2020

Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level.
Int. J. Appl. Cryptogr., 2020

Parallel Computation of Optimal Ate Cryptographic Pairings at the 128, 192 and 256-bit security levels using elliptic net algorithm.
CoRR, 2020

2019
A New Attack on RSA and Demytko's Elliptic Curve Cryptosystem.
IACR Cryptol. ePrint Arch., 2019

Analogue of Vélu's Formulas for Computing Isogenies over Hessian Model of Elliptic Curves.
IACR Cryptol. ePrint Arch., 2019

2018
An Encoding for the Theta Model of Elliptic Curves.
Proceedings of the Innovations and Interdisciplinary Solutions for Underserved Areas, 2018

2016
Adequate Elliptic Curve for Computing the Product of n Pairings.
IACR Cryptol. ePrint Arch., 2016

On the Computation of the Optimal Ate Pairing at the 192-bit Security Level.
IACR Cryptol. ePrint Arch., 2016

Optimal Ate Pairing on Elliptic Curves with Embedding Degree 9, 15 and 27.
IACR Cryptol. ePrint Arch., 2016

Faster Ate pairing computation on Selmer's model of elliptic curves.
Groups Complex. Cryptol., 2016

Adequate Elliptic Curves for Computing the Product of n Pairings.
Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

2015
Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography.
Proceedings of the Codes, Cryptology, and Information Security, 2015

2014
Efficient computation of pairings on Jacobi quartic elliptic curves.
J. Math. Cryptol., 2014

2013
Efficient Pairings Computation on Jacobi Quartic Elliptic Curves.
IACR Cryptol. ePrint Arch., 2013

2012
Edwards model of elliptic curves defined over any fields.
IACR Cryptol. ePrint Arch., 2012

Tate Pairing Computation on Jacobi's Elliptic Curves.
Proceedings of the Pairing-Based Cryptography - Pairing 2012, 2012


  Loading...