#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2012

2016

- This year (0)
- Last five years (10)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Sylvain Duquesne, Emmanuel Fouotsa
- Pairing
- 2012

- Loubna Ghammam, Emmanuel Fouotsa
- IACR Cryptology ePrint Archive
- 2016

Barreto, Lynn and Scott elliptic curves of embedding degree 12 denoted BLS12 have been proven to present fastest results on the implementation of pairings at the 192-bit security level [1]. The computation of pairings in general involves the execution of the Miller algorithm and the final exponentiation. In this paper, we improve the complexity of these two… (More)

- Oumar Diao, Emmanuel Fouotsa
- IACR Cryptology ePrint Archive
- 2012

In this paper, we present a generalization of Edwards model for elliptic curve which is dened over any eld and in particular for eld of characteristic 2. This model generalize the well known Edwards model of [10] over characteristic zero eld, moreover it dene an ordinary elliptic curve over binary elds. For this, we use the theory of theta functions and an… (More)

- Sylvain Duquesne, Nadia El Mrabet, Emmanuel Fouotsa
- IACR Cryptology ePrint Archive
- 2013

This paper proposes the computation of the Tate pairing, Ate pairing and its variations on the special Jacobi quartic elliptic curve Y 2 = dX 4 + Z 4. We improve the doubling and addition steps in Miller's algorithm to compute the Tate pairing. We use the birational equivalence between Jacobi quartic curves and Weierstrass curves, together with a specific… (More)

- Sylvain Duquesne, Nadia El Mrabet, Emmanuel Fouotsa
- J. Mathematical Cryptology
- 2014

This paper proposes the computation of the Tate pairing, Ate pairing and its variations on the special Jacobi quartic elliptic curve Y 2 D dX 4 C Z 4. We improve the doubling and addition steps in Miller's algorithm to compute the Tate pairing. We use the birational equivalence between Jacobi quartic curves and Weierstrass curves, together with a specific… (More)

- Emmanuel Fouotsa, Abdoul Aziz Ciss
- Groups Complexity Cryptology
- 2016

- Nadia El Mrabet, Emmanuel Fouotsa
- C2SI
- 2015

- Loubna Ghammam, Emmanuel Fouotsa
- WAIFI
- 2016

Many pairing-based protocols require the computation of the product and/or of a quotient of n pairings where n > 1 is a natural integer. Zhang et al.[1] recently showed that the Kachisa-Schafer and Scott family of elliptic curves with embedding degree 16 denoted KSS16 at the 192-bit security level is suitable for such protocols comparatively to the… (More)

- Emmanuel Fouotsa, Nadia El Mrabet, Aminatou Pecha
- IACR Cryptology ePrint Archive
- 2016

Since the advent of pairing based cryptography, much attention has been given to efficient computation of pairings on elliptic curves with even embedding degrees. The few works that exist in the case of odd embedding degrees require some improvements. This paper considers the computation of optimal ate pairings on elliptic curves of embedding degrees k = 9,… (More)

- ‹
- 1
- ›