Welcome to the resource topic for 2015/622
Title:
Random Digit Representation of Integers
Authors: Nicolas Méloni, M. Anwar Hasan
Abstract:Modular exponentiation is core to today’s main stream public key cryptographic systems. In this article, we generalize the classical fractional $w$NAF method for modular exponentiation – the classical method uses a digit set of the form \{1,3,\dots,m\} which is extended here to any set of odd integers of the form \{1,d_2,\dots, d_n\}. We give a formula for the average density of non-zero terms in this new representation and discuss its asymptotic behavior when those digits are randomly chosen from a given set. We also propose a specific method for the precomputation phase of the exponentiation algorithm.
ePrint: https://eprint.iacr.org/2015/622
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .