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),...
Saved in:
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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A scalar multiplication in elliptic curve cryptography with binary polynomial operations in galois field /
by: Modares, Hero
Published: (2009) -
An improved public key cryptography based on the elliptic curve
by: Al-Daoud, Essam Faleh
Published: (2002) -
A lightweight and secure algorithm of elliptic curve cryptography scalar multiplication using Q-NAF method in Lopez-Dahab coordinate
by: Abdulraheem, Waleed Khalid Amin
Published: (2019) -
Cryptanalysis of RSA and its variants using continuous midpoint subdivision analysis and lattices
by: Wan Mohd Ruzai, Wan Nur Aqlili
Published: (2021) -
A New "F-Lueg" Cryptosystem and its Security
by: Choo, Mun Yoong
Published: (2002)