Design and performance evaluation of parallel elliptic curve cryptosystem with GF(P) projective coordinates
Elliptic Curves Cryptosystem (ECC) has been introduced as a secure and efficient public key algorithm. A number of elliptic curves representations have been presented, such as Standard (Weierstrass), Edwards, Binary Edwards, Montgomery curves, and others. ECC’s computations suffer the long time inve...
Saved in:
Main Author: | Hussein Fayiz, Mohammad Al-Khatib |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2012
|
Online Access: | http://psasir.upm.edu.my/id/eprint/33143/1/FSKTM%202012%2025R.pdf http://psasir.upm.edu.my/id/eprint/33143/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Choices on designing GF (p) elliptic curve coprocessor benefiting from mapping homogeneous curves in parallel multiplications
by: Al-Haija, Qasem Abu, et al.
Published: (2011) -
On the design of projective binary Edwards elliptic curves over GF (p) benefitting from mapping elliptic curves computation to variable degree of parallel design
by: Al-Khatib, Mohammad Hussein Fayiz, et al.
Published: (2011) -
Trade-off between area and speed for projective Edwards Elliptic Curves Crypto-system over GF (p) using parallel hardware designs and architectures
by: Al-Khatib, Mohammad Hussein Fayiz, et al.
Published: (2011) -
Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance.
by: Mohammad Alkhatib,, et al.
Published: (2012) -
Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance.
by: Alkhatib, Mohammad, et al.
Published: (2013)