Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
Elliptic curve cryptosystem (ECC) is being used nowadays more than ever to fulfill the need for public key cryptosystem because of its ability to use shorter keys lengths and computationally more efficient algorithms than anther public key cryptosystems such as Rivest-Shamir- Adleman (RSA),...
Main Author: | Al-Saffar, Najlae Falah Hameed |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/71270/1/IPM%202015%2019%20IR.pdf |
Similar Items
-
Improvement scalar multiplication in elliptic curve cryptography /
by: Sui, Tao, 1988- author, et al.
Published: (2014) -
Improvement scalar multiplication in elliptic curve cryptography [electronic resource] /
by: Sui, Tao, 1988- author
Published: (2014) -
An improved binary method for scalar multiplication in elliptic curve cryptography
by: Mohamed, Mohamad Afendee, et al.
Published: (2010) -
Elliptic curve group over finite field and its application in The Diffie-Hellman key exchange /
by: 261447 Mohd. Rizuan Baharon
Published: (2005) -
Lightweight Architecture for Elliptic Curve Scalar Multiplication over Prime Field
by: Yue Hao, et al.
Published: (2022-07-01)