Cryptology ePrint Archive: Report 2013/466
Efficient computation of addition-subtraction chains using generalized continued Fractions
Amadou Tall and Ali Yassin Sanghare
Abstract: The aim of this paper is to present a new way of computing short addition-subtraction chains using the generalized continued fractions where subtraction is allowed. We will recover the most used ways of getting addition-subtraction chains. This method is not always optimal but gives minimal chains that are easy to compute.
Category / Keywords: foundations / addition-subtraction chains; non-adjacent form; scalar multiplication; double-and-add method; vector chains; continued fractions; Euclidean algorithm.
Original Publication (in the same form): International Journal of Mathematical Research
Date: received 29 Jul 2013
Contact author: amadou tall at aims-senegal org
Available format(s): PDF | BibTeX Citation
Version: 20130802:125852 (All versions of this report)
Short URL: ia.cr/2013/466
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]