{"id":{"repo_id":"unt","oai_identifier":"info:ark/67531/metadc3963"},"canonical_url":"https://search.dev.ndltd.org/etd/unt/info:ark/67531/metadc3963","repository":{"repo_id":"unt","name":"University of North Texas","base_url":"https://digital.library.unt.edu/oai/"},"display":{"title":"FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Huang, Jian"],"institution":"University of North Texas","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Li, Hao","Sweany, Philip H.","Kavi, Krishna M."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2007,"date_issued":"2007-08","date_published":"2007-08","updated_at":"2026-07-24T05:35:09Z","subjects":["FPGA","hardware","elliptic curve cryptography","bilinear map","Tate pairing","Computer security.","Data encryption (Computer science)","Field programmable gate arrays.","Curves, Elliptic.","Cryptography -- Mathematics."],"languages":["English"],"rights":["Public","Copyright","Huang, Jian","Copyright is held by the author, unless otherwise noted. All rights reserved."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["oclc: 191207316","https://digital.library.unt.edu/ark:/67531/metadc3963/","ark: ark:/67531/metadc3963"],"render_values":[{"text":"oclc: 191207316","href":null,"code":true},{"text":"https://digital.library.unt.edu/ark:/67531/metadc3963/","href":"https://digital.library.unt.edu/ark:/67531/metadc3963/","code":true},{"text":"ark: ark:/67531/metadc3963","href":null,"code":true}]}]},"links":{"outbound_url":"https://doi.org/10.12794/metadc3963","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Li, Hao","Sweany, Philip H.","Kavi, Krishna M."]},{"key":"dc:creator","label":"Author","values":["Huang, Jian"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2007-08"]},{"key":"dc:publisher","label":"Institution","values":["University of North Texas"]},{"key":"dc:type","label":"Dc Type","values":["Thesis or Dissertation"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["FPGA","hardware","elliptic curve cryptography","bilinear map","Tate pairing","Computer security.","Data encryption (Computer science)","Field programmable gate arrays.","Curves, Elliptic.","Cryptography -- Mathematics."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["Public","Copyright","Huang, Jian","Copyright is held by the author, unless otherwise noted. All rights reserved."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["oclc: 191207316","doi: 10.12794/metadc3963","https://digital.library.unt.edu/ark:/67531/metadc3963/","ark: ark:/67531/metadc3963"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:format","label":"Dc Format","values":["Text"]},{"key":"dc:title","label":"Title","values":["FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field"]}]}],"canonical_facts":{"dc:contributor":["Li, Hao","Sweany, Philip H.","Kavi, Krishna M."],"dc:creator":["Huang, Jian"],"dc:date":["2007-08"],"dc: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."],"dc:format":["Text"],"dc:identifier":["oclc: 191207316","doi: 10.12794/metadc3963","https://digital.library.unt.edu/ark:/67531/metadc3963/","ark: ark:/67531/metadc3963"],"dc:language":["English"],"dc:publisher":["University of North Texas"],"dc:rights":["Public","Copyright","Huang, Jian","Copyright is held by the author, unless otherwise noted. All rights reserved."],"dc:subject":["FPGA","hardware","elliptic curve cryptography","bilinear map","Tate pairing","Computer security.","Data encryption (Computer science)","Field programmable gate arrays.","Curves, Elliptic.","Cryptography -- Mathematics."],"dc:title":["FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field"],"dc:type":["Thesis or Dissertation"]},"updated_at":"2026-07-24T05:35:09Z"}