THE FPGA IMPLEMENTATION OF AN EFFICIENT ELLIPLIC CURVE CRYPTOGRAPHIC PROCESS OVER GF (2163)

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.

MASOUMI M.; MAHDIZADEH H.

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

Journal Paper

Paper Information

Journal: Advanced Defense Science and Technology Year:2012 | Volume:3 | Issue:3 (9) Page(s): 199-211

Download Full-Text

Persian Verion

View:

878

Download:

Cites:

Information Journal Paper

Title

THE FPGA IMPLEMENTATION OF AN EFFICIENT ELLIPLIC CURVE CRYPTOGRAPHIC PROCESS OVER GF (2163)

Author(s)

MASOUMI M. | MAHDIZADEH H. | Issue Writer Certificate

Keywords

ELLIPTIC CURVE CRYPTOGRAPHYQ3

SCALAR POINT MULTIPLICATIONQ3

FPGA IMPLEMENTATIONQ3

Abstract

A new and highly efficient architecture for elliptic curve SCALAR POINT MULTIPLICATION is presented. To achieve the maximum architectural and timing improvements, the critical path of the Lopez-Dahab SCALAR POINT MULTIPLICATION architecture has been reorganized and reordered such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical paths. The results show that with G=41, the proposed design is able to compute GF (2163) elliptic curve scalar multiplication in 11.92% s with the maximum achievable frequency of 251 MHz on Xilinx Virtex-4 (XC4VLX200), where G is the digit size of the underlying digit-serial finite field multiplier. The results of synthesis show that in this implementation 19606 slices or 22% of the chip area is occupied.

Cites

No record.

References

No record.

Cite

APA: Copy

MASOUMI, M., & MAHDIZADEH, H.. (2012). THE FPGA IMPLEMENTATION OF AN EFFICIENT ELLIPLIC CURVE CRYPTOGRAPHIC PROCESS OVER GF (2¹⁶³). (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, 3(3 (9)), 199-211. SID. https://sid.ir/paper/167340/en

Vancouver: Copy

MASOUMI M., MAHDIZADEH H.. THE FPGA IMPLEMENTATION OF AN EFFICIENT ELLIPLIC CURVE CRYPTOGRAPHIC PROCESS OVER GF (2¹⁶³). (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY[Internet]. 2012;3(3 (9)):199-211. Available from: https://sid.ir/paper/167340/en

IEEE: Copy

M. MASOUMI, and H. MAHDIZADEH, “THE FPGA IMPLEMENTATION OF AN EFFICIENT ELLIPLIC CURVE CRYPTOGRAPHIC PROCESS OVER GF (2¹⁶³),” (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, vol. 3, no. 3 (9), pp. 199–211, 2012, [Online]. Available: https://sid.ir/paper/167340/en

Related Journal Papers