A FAST METHOD FOR COMPUTATION OF SCALAR MULTIPLICATION OF ELLIPTIC CURVE SUITABLE FOR ELLIPTIC CURVE CRYPTOGRAPHY SYSTEM

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.

MIRGHADRI A.R.; RAHIMI S.

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

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2015 | Volume:3 | Issue:3 (11) Page(s): 9-17

Download Full-Text

Persian Verion

View:

1,769

Download:

Cites:

Information Journal Paper

Title

A FAST METHOD FOR COMPUTATION OF SCALAR MULTIPLICATION OF ELLIPTIC CURVE SUITABLE FOR ELLIPTIC CURVE CRYPTOGRAPHY SYSTEM

Author(s)

MIRGHADRI A.R. | RAHIMI S. | Issue Writer Certificate

Keywords

SCALAR MULTIPLICATIONQ2

ELLIPTIC CURVE CRYPTOGRAPHYQ2

COMPUTATIONAL OPERATIONSQ2

ELECTRONIC VOTINGQ1

Abstract

Elliptic curve cryptography system due to the short key length and high level of security is most important encryption system for use in ELECTRONIC VOTING. The problem with this system is a lot of computation time due to the complexity of COMPUTATIONAL OPERATIONS on elliptic curve is over. Multiplication of ELLIPTIC CURVE CRYPTOGRAPHY system is time consuming operations that about 85% of the time spent implementing the encryption algorithm stems. Hence, we propose an optimal method to reduce the cost of providing time of multiplication operations. The proposed method improved in two main parts, the parts of the control and computing encryption algorithm, has the good performance. The result of evaluation and comparison of the proposed method with some conserned algorithms, shows that this method compared to other algorithms, is faster and very good performance.

Cites

No record.

References

No record.

Cite

APA: Copy

MIRGHADRI, A.R., & RAHIMI, S.. (2015). A FAST METHOD FOR COMPUTATION OF SCALAR MULTIPLICATION OF ELLIPTIC CURVE SUITABLE FOR ELLIPTIC CURVE CRYPTOGRAPHY SYSTEM. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 3(3 (11)), 9-17. SID. https://sid.ir/paper/243184/en

Vancouver: Copy

MIRGHADRI A.R., RAHIMI S.. A FAST METHOD FOR COMPUTATION OF SCALAR MULTIPLICATION OF ELLIPTIC CURVE SUITABLE FOR ELLIPTIC CURVE CRYPTOGRAPHY SYSTEM. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2015;3(3 (11)):9-17. Available from: https://sid.ir/paper/243184/en

IEEE: Copy

A.R. MIRGHADRI, and S. RAHIMI, “A FAST METHOD FOR COMPUTATION OF SCALAR MULTIPLICATION OF ELLIPTIC CURVE SUITABLE FOR ELLIPTIC CURVE CRYPTOGRAPHY SYSTEM,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 3, no. 3 (11), pp. 9–17, 2015, [Online]. Available: https://sid.ir/paper/243184/en

Related Journal Papers