Multi-base number representation in application to scalar multiplication and pairing computation
Elliptic curves scalar multiplication over finite fields has become a highly active research area. The efficiency of elliptic curves scalar multiplication is about keeping the memory and running time to be as low as possible. Providing new methods using chains beyond the binary chain will increase t...
Saved in:
Main Author: | Mohammed Ismail, Abdelwahed |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2011
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/26781/1/IPM%202011%2018R.pdf http://psasir.upm.edu.my/id/eprint/26781/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
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) -
An improved public key cryptography based on the elliptic curve
by: Al-Daoud, Essam Faleh
Published: (2002) -
Properties of pseudo τ- adic non-adjacent form and the expansion of τ-adic non-adjacent form
by: Mohd Suberi, Syahirah
Published: (2017) -
Kembangan pseudotnaf untuk pendaraban skalar di atas lenkuk koblitz
by: Yunos, Faridah
Published: (2014) -
Enhancement of encryption techniques using elliptic curve cryptography
by: Ziad Ershaid Ahmad, Dawahdeh
Published: (2017)