Shorter addition chain for smooth integers using decomposition method.

An efficient computation of scalar multiplication in elliptic curve cryptography can be achieved by reducing the original problem into a chain of additions and doublings. Finding the shortest addition chain is an NP-problem. To produce the nearest possible shortest chain, various methods were introd...

Full description

Saved in:
Bibliographic Details
Main Authors: Mohamed, M. A., Md. Said, Mohamad Rushdan, Mohd Atan, Kamel Ariffin, Ahmad Zulkarnain, Zuriati
Format: Article
Language:English
English
Published: Taylor & Francis 2011
Online Access:http://psasir.upm.edu.my/id/eprint/25154/1/Shorter%20addition%20chain%20for%20smooth%20integers%20using%20decomposition%20method.pdf
http://psasir.upm.edu.my/id/eprint/25154/
http://www.tandf.co.uk/journals/default.asp
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first