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

  1. On computation of the Cassels-Tate pairing

    … C/k. In dieser Arbeit berechnen wir die Cassels- Tate-Paarung für Selmergruppen verschiedener Isogenien auf Jacobischen Varietäten verschiedener Kurventypen. Das Hauptziel der Arbeit ist es, die Albanese-Albanese-Definition der Paarung zu verwenden, um einen Algorithmus zu erhalten. Wir beginnen …

    bayreuth Repository record for On computation of the Cassels-Tate pairing (opens in a new tab)

  2. 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)

  3. 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)

  4. 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 Download PDF for Constructing suitable ordinary pairing-friendly curves: A case of elliptic curves and genus two hyperelliptic curves (opens in a new tab)

  5. 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)

  6. 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)

  7. 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 Download PDF for A Java based software solution for efficient pairing cryptography. (opens in a new tab)

  8. 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)

  9. 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 Download PDF for Cryptographic key distribution in wireless sensor networks: a hardware perspective (opens in a new tab)

  10. Machine-Level Software Optimization of Cryptographic Protocols

    … that efficiently computes the Optimal Ate pairing over Barreto-Naehrig curves proposed by Grewal et al.. We give an introduction to cryptographic pairings and describe the Tate pairing and its variants. We then proceed to describe Grewal et al.'s implementation of Miller's algorithm, along …

    waterloo Repository record for Machine-Level Software Optimization of Cryptographic Protocols (opens in a new tab)

  11. On the Shafarevich-Tate group of an elliptic curve

    … finding non-trivial elements in the Shafarevich-Tate group of an elliptic curve. The set of K-rational points on an elliptic curve, E, are known to form a finitely generated abelian group. My results are of interest when trying to find the rank of this group, which in general is a hard problem. …

    arizona-thes Repository record for On the Shafarevich-Tate group of an elliptic curve (opens in a new tab)

  12. On the Efficiency and Security of Cryptographic Pairings

    Pairing-based cryptography has been employed to obtain several advantageous cryptographic protocols. In particular, there exist several identity-based variants of common cryptographic schemes. The computation of a single pairing is a comparatively expensive operation, since it often requires many …

    waterloo Repository record for On the Efficiency and Security of Cryptographic Pairings (opens in a new tab)

  13. Elliptic Curve Arithmetic for Cryptography

    … multiplication. Further, this thesis revisits pairing computations which use elliptic curve groups to compute pairings such as the Tate pairing. More specifically, the thesis looks at Stange's algorithm to compute pairings and also pairings on Selmer curves. The thesis also looks at some …

    anu Repository record for Elliptic Curve Arithmetic for Cryptography (opens in a new tab)

  14. 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)

  15. Efficient Cryptographic Algorithms and Protocols for Mobile Ad Hoc Networks

    … respectively, when compared to the state-of-the-art ultra-lightweight block cipher PRESENT on the similar platforms. In addition, the speed optimized Hummingbird encryption core can achieve a throughput of 160.4 Mbps and the area optimized encryption core only occupies 253 slices on a …

    waterloo Repository record for Efficient Cryptographic Algorithms and Protocols for Mobile Ad Hoc Networks (opens in a new tab)