Sciweavers

Share
SACRYPT
2004
Springer

A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue

10 years 8 months ago
A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of inverses is a fast operation. Cohen and Solinas independently described one such recoding, the w-NAF. For scalars of the size commonly used in cryptographic applications, it leads to the current scalar multiplication algorithm of choice. However, we could find no formal proof of its optimality in the literature. This recoding is computed right-to-left. We solve two open questions regarding the w-NAF. We first prove that the w-NAF is a redundant radix-2 recoding of smallest weight among all those with integral
Roberto Maria Avanzi
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where SACRYPT
Authors Roberto Maria Avanzi
Comments (0)
books