NAF Representation

Using algorithm here (this algorithm is equal with Algorithm 3.30 in Guide to Elliptic Curve Cryptography, Hankerson-Menezes-Vanstone, #98), the result is:


  1. The length of NAF representation is at most one more than the length of the binary representation of k.
  2. In NAF representation, non-zero values cannot be adjacent.