Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"pairing computation"”.

  1. Pairing computation on hyperelliptic curves of genus 2

    Bilinear pairings have been recently used to construct cryptographic schemes with new and novel properties, the most celebrated example being the Identity Based Encryption scheme of Boneh and Franklin. As pairing computation is generally the most computationally intensive part of any painng-based …

    dcu Download PDF for Pairing computation on hyperelliptic curves of genus 2 (opens in a new tab)

  2. Efficient Pairings on Various Platforms

    Pairings have found a range of applications in many areas of cryptography. As such, to utilize the enormous potential of pairing-based protocols one needs to efficiently compute pairings across various computing platforms. In this thesis, we give an introduction to pairing-based cryptography and …

    waterloo Repository record for Efficient Pairings on Various Platforms (opens in a new tab)

  3. FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field

    … size without sacrificing security level. Tate pairing is a bilinear map used in identity based cryptography schemes. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. Similarly, Tate pairing is also quite …

    unt Repository record for FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field (opens in a new tab)

  4. Hardware processors for pairing-based cryptography

    Bilinear pairings can be used to construct cryptographic systems with very desirable properties. A pairing performs a mapping on members of groups on elliptic and genus 2 hyperelliptic curves to an extension of the finite field on which the curves are defined. The finite fields must, however, be …

    cork Repository record for Hardware processors for pairing-based cryptography (opens in a new tab)

  5. Optimal Pairings on BN Curves

    Bilinear pairings are being used in ingenious ways to solve various protocol problems. Much research has been done on improving the efficiency of pairing computations. This thesis gives an introduction to the Tate pairing and some variants including the ate pairing, Vercauteren's pairing, and the …

    waterloo Repository record for Optimal Pairings on BN Curves (opens in a new tab)

  6. High-Speed Elliptic Curve and Pairing-Based Cryptography

    … higher speeds. Moreover, the dramatic entry of pairing-based cryptosystems defined on elliptic curves at the beginning of the new millennium has opened the possibility of a plethora of innovative applications, solving in some cases longstanding problems in cryptography. Nevertheless, public-key …

    waterloo Repository record for High-Speed Elliptic Curve and Pairing-Based Cryptography (opens in a new tab)

  7. Investigating power and fault analysis with specific application to bilinear pairings

    The security of bilinear pairings against implementation attacks such as side channel and fault attacks is largely an uncharted area of research. Apart from one publication on the topic, coverage of this area is non-existent. Armed with the fact that the number of applications based on bilinear …

    dcu Download PDF for Investigating power and fault analysis with specific application to bilinear pairings (opens in a new tab)