In this paper we study the number of carries occurring while performing an addition modulo .
For a fixed modular integer , it is natural to expect the number of carries occurring when adding a random modular integer to be roughly the Hamming weight of .
Here we are interested in the number of modular integers in producing strictly more than this number of carries when added to a fixed modular integer .
In particular it is conjectured that less than half of them do so.
An equivalent conjecture was proposed by Tu and Deng in a different context~\cite{DCC:TD}.
Although quite innocent, this conjecture has resisted different attempts of proof~\cite{DBLP:conf/seta/FloriRCM10, cryptoeprint:2010:170, cusick_combinatorial_2011, Carlet:Private} and only a few cases have been proved so far.
The most manageable cases involve modular integers whose bits equal to are sparse.
In this paper we continue to investigate the properties of , the fraction of modular integers to enumerate, for in this class of integers.
Doing so we prove that has a polynomial expression and describe a closed form of this expression.
This is of particular interest for computing the function giving and studying it analytically.
Finally we bring to light additional properties of in an asymptotic setting and give closed forms for its asymptotic values.
@misc{cryptoeprint:2011/245,
author = {Jean-Pierre Flori and Hugues Randriam},
title = {On the Number of Carries Occuring in an Addition $\mod 2^k-1$},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/245},
year = {2011},
url = {https://eprint.iacr.org/2011/245}
}
Note: In order to protect the privacy of readers, eprint.iacr.org
does not use cookies or embedded third party content.