Iterative sliding window method for shorter number of operations in modular exponentiation and scalar multiplication
Cryptography via public key cryptosystems (PKC) has been widely used for providing services such as confality, authentication, integrity and non-repudiation. Other than security, computational efficiency is another major issue of concern. And for PKC, it is largely controlled by either modular expon...
Saved in:
Main Authors: | Noma, Adamu Muhammad, Muhammed, Abdullah, Ahmad Zukarnain, Zuriati, Mohamed, Muhammad Afendee |
---|---|
Format: | Article |
Language: | English |
Published: |
Cogent OA
2017
|
Online Access: | http://psasir.upm.edu.my/id/eprint/62242/1/Iterative%20sliding%20window%20method%20for%20shorter%20number.pdf http://psasir.upm.edu.my/id/eprint/62242/ https://www.tandfonline.com/doi/full/10.1080/23311916.2017.1304499 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An improved binary method for scalar multiplication in elliptic curve cryptography
by: Mohamed, Mohamad Afendee, et al.
Published: (2010) -
Signed decomposition method for scalar multiplication in elliptic curve cryptography
by: Md. Said, Mohamad Rushdan, et al.
Published: (2010) -
A hybrid addition chain method for faster scalar multiplication
by: Mohamed, Mohamad Afendee, et al.
Published: (2015) -
A hybrid addition chain method for faster scalar multiplication
by: Mohamad Afendee, Mohamed, et al.
Published: (2015) -
Multi-base number representation in application to scalar multiplication and pairing computation
by: Mohammed Ismail, Abdelwahed
Published: (2011)