Since 2000 pairings became a very useful tool to design new protocols in cryptography. Short signaturesand identity-based encryption became also practical thanks to these pairings.This thesis contains two parts. One part is about optimized pairing implementation on different ellip-tic curves according to the targeted protocol. Pairings are implemented on supersingular elliptic curve...

We provide a relation between the $\mu $-invariants of dual plus and minus Selmer groups for supersingular elliptic curves when we ascend from cyclotomic ${\mathbb Z}_p$-extension to Z}_p^2$-extension over an imaginary quadratic field.

In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical and myriad applications in cryptography. Well known efficient examples are the Weil and Tate pairings and their variants such as the Eta and Ate pairings on the Jacobians of (hyper-)elliptic curves. In this paper, we consider the use of projective coordinates for ...

We formulate an analogue of the conjecture of Birch and Swinnerton-Dyer for Abelian schemes with everywhere good reduction over higher dimensional bases over finite fields. We prove some conditional results for the p′-part on it, and prove the p′-part of the conjecture for constant or isoconstant Abelian schemes, in particular the p′-part for (1) relative elliptic curves with good reduction or ...

Finding suitable non-supersingular elliptic curves becomes an important issue for the growing area of pairing-based cryptosystems. For this purpose, many methods have been proposed when embedding degree k and cofactor h are taken different values. In this paper we propose a new method to find pairing-friendly elliptic curves without restrictions on embedding degree k and cofactor h. We propose ...

In this paper we present a new algorithm for computing the bilinear pairings on a family of non-supersingular elliptic curves with non-trivial automorphisms. We obtain a short iteration loop in Miller’s algorithm using non-trivial efficient automorphisms. The proposed algorithm is as efficient as the algorithm in [12].

We show that computation of a sequence of Richelot isogenies from specified supersingular Jacobians of genus-2 curves over Fp can be executed in Fp2 or Fp4 . Based on this, we describe a practical algorithm for computing a Richelot isogeny sequence.