Certificateless Signcryption Tag Key Encapsulation Mechanism (CLSC-TKEM) is an effective method for simultaneously providing key encapsulation and a digital signature on the tag. It has applications in several security services such as communication confidentiality, integrity, authentication, and non-repudiation. Moreover, because CLSC-TKEM is based on certificateless public key cryptography (C...

The origin of pairing based cryptosystems is in the MOV attack [10] on the elliptic curve discrete logarithm problem. The attack was first envisioned by Gerhard Frey. The idea was to use the bilinear properties of the Weil pairing to reduce a discrete logarithm problem in an elliptic curve over a finite field Fq to a discrete logarithm problem in Fqk . It is known [1] that most of the time for ...

Pairing-friendly fields are finite fields that are suitable for the implementation of cryptographic bilinear pairings. In this paper we review multiplication and squaring methods for pairing-friendly fields Fpk with k ∈ {2, 3, 4, 6}. For composite k, we consider every possible towering construction. We compare the methods to determine which is most efficient based on the number of basic Fp oper...

Recently, there have been many proposals for secure and novel cryptographic protocols that are built on bilinear pairings. The ηT pairing is one such pairing and is closely related to the Tate pairing. In this paper we consider the efficient hardware implementation of this pairing in characteristic 3. All characteristic 3 operations required to compute the pairing are outlined in detail. An eff...

Cryptographic pairing (bilinear mapping) is a core algorithm for various cryptography protocols. It is computationally expensive and inefficiently computed with general purpose processors. Although there has been previous work looking into efficient hardware designs for pairing, most of these systems use small characteristic curves which are incompatible with practical software designs. In this...

Let k = Fq(t) be the rational function field with finite constant field and characteristic p ≥ 3, and let K/k be a finite separable extension. For a fixed place v of k and an elliptic curveE/K which has ordinary reduction at all places ofK extending v, we consider a canonical height pairing 〈 , 〉v : E(K ) × E(K) → C v which is symmetric, bilinear and Galois equivariant. The pairing 〈 , 〉∞ for t...

In Asiacrypt2001, Boneh, Lynn, and Shacham [8] proposed a short signature scheme (BLS scheme) using bilinear pairing on certain elliptic and hyperelliptic curves. Subsequently numerous cryptographic schemes based on BLS signature scheme were proposed. BLS short signature needs a special hash function [6, 1, 8]. This hash function is probabilistic and generally inefficient. In this paper, we pro...