FPGA IMPLEMENTATION OF CRYPTOGRAPHIC SYSTEMS BASED ON TATE PAIRING ON BINARY FIELD

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JAHANBANI MOHSEN; NOROOZI ZEYNOLABEDIN; BAGHERI NASOR

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Advanced Defense Science and Technology Year:2016 | Volume:7 | Issue:2 Page(s): 95-106

Download Full-Text

Persian Verion

View:

851

Download:

Cites:

Information Journal Paper

Title

FPGA IMPLEMENTATION OF CRYPTOGRAPHIC SYSTEMS BASED ON TATE PAIRING ON BINARY FIELD

Author(s)

JAHANBANI MOHSEN | NOROOZI ZEYNOLABEDIN | BAGHERI NASOR | Issue Writer Certificate

Keywords

TATE PAIRINGQ2

ELLIPTIC CURVEQ2

BINARY FINITE FIELDQ2

HARDWARE ARCHITECTUREQ2

FPGAQ2

Abstract

Pairing-based cryptography is the use of a pairing between elements of two additive group on ELLIPTIC CURVE to a third multiplicative group on finite field to construct or analyze cryptographic systems. The TATE PAIRING is a common pairing and computed by use of Miller`s algorithm. Improved version for this algorithm on super singular ELLIPTIC CURVE is named & etaT. Pairing is quite computationally expensive and time consuming. Therefore, it is more attractive to implement on hardware rather than software. In this paper we proposed a new architecture for computation of pairing on F2283. This architecture is resulted from merging two parts of algorithm including pairing and final exponentiation and using resource sharing technique. The base of TATE PAIRING is finite field arithmetic units. Design and synthesis of this implementation are conducted using Xilinx`s FPGA. Comparison between this result and other work shows that this implementation gains %38 improvements on calculation time and %10 improvement on product of area and time. Also software implementation is done by SAGE mathematical software for justifying of the results and generating points on ELLIPTIC CURVE.

Cites

No record.

References

No record.

Cite

APA: Copy

JAHANBANI, MOHSEN, NOROOZI, ZEYNOLABEDIN, & BAGHERI, NASOR. (2016). FPGA IMPLEMENTATION OF CRYPTOGRAPHIC SYSTEMS BASED ON TATE PAIRING ON BINARY FIELD. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, 7(2), 95-106. SID. https://sid.ir/paper/167525/en

Vancouver: Copy

JAHANBANI MOHSEN, NOROOZI ZEYNOLABEDIN, BAGHERI NASOR. FPGA IMPLEMENTATION OF CRYPTOGRAPHIC SYSTEMS BASED ON TATE PAIRING ON BINARY FIELD. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY[Internet]. 2016;7(2):95-106. Available from: https://sid.ir/paper/167525/en

IEEE: Copy

MOHSEN JAHANBANI, ZEYNOLABEDIN NOROOZI, and NASOR BAGHERI, “FPGA IMPLEMENTATION OF CRYPTOGRAPHIC SYSTEMS BASED ON TATE PAIRING ON BINARY FIELD,” (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, vol. 7, no. 2, pp. 95–106, 2016, [Online]. Available: https://sid.ir/paper/167525/en

Related Journal Papers