Parallel method for computing elliptic curve scalar multiplication based on MOF
Joint Authors
Samsudin, Azman
Anaqirah, Muhammad
Umar, Muhd Adib
Source
The International Arab Journal of Information Technology
Issue
Vol. 11, Issue 6 (30 Nov. 2014)5 p.
Publisher
Publication Date
2014-11-30
Country of Publication
Jordan
No. of Pages
5
Main Subjects
Information Technology and Computer Science
Topics
Abstract EN
This paper focuses on optimizing the Elliptic Curve Cryptography (ECC) scalar multiplication by optimizing one of the ECC calculations, which is based on the Mutual Opposite Form (MOF) algorithm.
A new algorithm is introduced that combines the add-subtract scalar multiplication algorithm with the MOF representation to speed-up the ECC scalar multiplication.
The implementation of the algorithm produces an efficient parallel method that improves the computation time.
The proposed method is an efficient ECC scalar multiplication that achieves a 90 % speed-up compared to the existing methods.
American Psychological Association (APA)
Anaqirah, Muhammad& Samsudin, Azman& Umar, Muhd Adib. 2014. Parallel method for computing elliptic curve scalar multiplication based on MOF. The International Arab Journal of Information Technology،Vol. 11, no. 6.
https://search.emarefa.net/detail/BIM-380116
Modern Language Association (MLA)
Anaqirah, Muhammad…[et al.]. Parallel method for computing elliptic curve scalar multiplication based on MOF. The International Arab Journal of Information Technology Vol. 11, no. 6 (Nov. 2014).
https://search.emarefa.net/detail/BIM-380116
American Medical Association (AMA)
Anaqirah, Muhammad& Samsudin, Azman& Umar, Muhd Adib. Parallel method for computing elliptic curve scalar multiplication based on MOF. The International Arab Journal of Information Technology. 2014. Vol. 11, no. 6.
https://search.emarefa.net/detail/BIM-380116
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-380116