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

Thumbnail image of item number 1 in: 'FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field'.
Thumbnail image of item number 2 in: 'FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field'.
Thumbnail image of item number 3 in: 'FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field'.
Thumbnail image of item number 4 in: 'FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field'.
Showing 1-4 of 70 pages in this thesis.

PDF Version Also Available for Download.

Description

Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller 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 computationally expensive. Therefore, it is more attractive to implement the ECC and Tate pairing using hardware than using software. The bases of both ECC and Tate pairing are Galois field arithmetic units. In this thesis, I propose the FPGA implementations of the elliptic … continued below

Creation Information

Huang, Jian August 2007.

Context

This thesis is part of the collection entitled: UNT Theses and Dissertations and was provided by the UNT Libraries to the UNT Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 2680 times, with 8 in the last month. More information about this thesis can be viewed below.

Who

People and organizations associated with either the creation of this thesis or its content.

Author

Chair

Committee Members

Publisher

Rights Holder

For guidance see Citations, Rights, Re-Use.

  • Huang, Jian

Provided By

UNT Libraries

The UNT Libraries serve the university and community by providing access to physical and online collections, fostering information literacy, supporting academic research, and much, much more.

About | Browse this Partner

Contact Us

Corrections Questions

What

Descriptive information to help identify this thesis. Follow the links below to find similar items on the Digital Library.

Description

Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller 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 computationally expensive. Therefore, it is more attractive to implement the ECC and Tate pairing using hardware than using software. The bases of both ECC and Tate pairing are Galois field arithmetic units. In this thesis, I propose the FPGA implementations of the elliptic curve point multiplication in GF (2283) as well as Tate pairing computation on supersingular elliptic curve in GF (2283). I have designed and synthesized the elliptic curve point multiplication and Tate pairing module using Xilinx's FPGA, as well as synthesized all the Galois arithmetic units used in the designs. Experimental results demonstrate that the FPGA implementation can speedup the elliptic curve point multiplication by 31.6 times compared to software based implementation. The results also demonstrate that the FPGA implementation can speedup the Tate pairing computation by 152 times compared to software based implementation.

Language

Item Type

Identifier

Unique identifying numbers for this thesis in the Digital Library or other systems.

Collections

This thesis is part of the following collection of related materials.

UNT Theses and Dissertations

Theses and dissertations represent a wealth of scholarly and artistic content created by masters and doctoral students in the degree-seeking process. Some ETDs in this collection are restricted to use by the UNT community.

About | Browse this Collection

What responsibilities do I have when using this thesis?

Digital Files

When

Dates and time periods associated with this thesis.

Creation Date

  • August 2007

Added to The UNT Digital Library

  • Jan. 14, 2008, 11:12 p.m.

Description Last Updated

  • May 6, 2014, 4:08 p.m.

Usage Statistics

When was this thesis last used?

Yesterday: 0
Past 30 days: 8
Total Uses: 2,680
More Statistics

Interact With This Thesis

Here are some suggestions for what to do next.

Start Reading

Thumbnail image of item number 1 in: 'FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field'.
Thumbnail image of item number 2 in: 'FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field'.
Thumbnail image of item number 3 in: 'FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field'.
Thumbnail image of item number 4 in: 'FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field'.

PDF Version Also Available for Download.

Citations, Rights, Re-Use

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Links for Robots

Helpful links in machine-readable formats.

Archival Resource Key (ARK)

International Image Interoperability Framework (IIIF)

Metadata Formats

Images

URLs

Stats

Huang, Jian. FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field, thesis, August 2007; Denton, Texas. (https://digital.library.unt.edu/ark:/67531/metadc3963/: accessed June 3, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; .

Back to Top of Screen