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 8 of 8 for “"Tate pairing"”.

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

    … key 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)

  2. Computing the Cassels-Tate Pairing for Jacobian Varieties of Genus Two Curves

    … focus of this thesis is on computing the Cassels-Tate pairing on the 2-Selmer group of J. We start by studying the Cassels-Tate pairing when J admits a Richelot 􏰑 isogeny φ : J → J. Suppose all points in J[2] are defined over K. We compute 􏰑􏰑 the Cassels-Tate pairing ⟨ , ⟩CT on Selφ􏰑(J)×Selφ􏰑(J) …

    cambridge Repository record for Computing the Cassels-Tate Pairing for Jacobian Varieties of Genus Two Curves (opens in a new tab)

  3. Constructing suitable ordinary pairing-friendly curves: A case of elliptic curves and genus two hyperelliptic curves

    One of the challenges in the designing of pairing-based cryptographic protocols is to construct suitable pairing-friendly curves: Curves which would provide e�cient implementation without compromising the security of the protocols. These curves have small embedding degree and large prime order …

    dcu Repository record for Constructing suitable ordinary pairing-friendly curves: A case of elliptic curves and genus two hyperelliptic curves (opens in a new tab)

  4. The Arithmetic of Elliptic and Hyperelliptic Curves with Applications to Pairing-Based Cryptography

    … of one variable, the thesis concentrates on pairings (such as the Tate pairing) defined on groups related to a given absolutely irreducible non-singular curve over a finite field. Those pairings are being studied in terms of their usability in cryptography. Important special cases, such as …

    oldenburg Repository record for The Arithmetic of Elliptic and Hyperelliptic Curves with Applications to Pairing-Based Cryptography (opens in a new tab)

  5. A Java based software solution for efficient pairing cryptography.

    … with applying software Engineering techniques to pairing based cryptographic systems. In particular we evolve our existing cryptographic system to incorporate new cryptographic concepts that strengthen the system. We discuss the design approach taken to allow an advanced mathematically based …

    maynooth Repository record for A Java based software solution for efficient pairing cryptography. (opens in a new tab)

  6. Cryptographic key distribution in wireless sensor networks: a hardware perspective

    … of its components parts. It was found that the Tate pairing component of the NIKDS consumes significants amounts of energy, and so it should be ported to hardware. An accelerator was implemented in 65nm Complementary Metal Oxide Silicon (CMOS) technology and area, timing and energy figures have …

    dcu Repository record for Cryptographic key distribution in wireless sensor networks: a hardware perspective (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 Repository record for Investigating power and fault analysis with specific application to bilinear pairings (opens in a new tab)