Paper 2005/384 Original: eprint.iacr.org/2005/384 ↗

Some Explicit Formulae of NAF and its Left-to-Right Analogue

Dong-Guk Han
Tetsuya Izu
Tsuyoshi Takagi
Abstract

Non-Adjacent Form (NAF) is a canonical form of signed binary representation of integers. We present some explicit formulae of NAF and its left-to-right analogue (FAN) for randomly chosen n-bit integers. Interestingly, we prove that the zero-run length appeared in FAN is asymptotically 16/7, which is longer than that of the standard NAF. We also apply the proposed formulae to the speed estimation of elliptic curve cryptosystems.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
History
2005-10-28: last updated
2005-10-24: published
Short URL
https://ia.cr/2005/384
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2005/384,
      author = {Dong-Guk Han and Tetsuya Izu and Tsuyoshi Takagi},
      title = {Some Explicit Formulae of NAF and its Left-to-Right Analogue},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/384},
      year = {2005},
      url = {https://eprint.iacr.org/2005/384}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.