Search arXivSearch

arXiv · 1009.0488

Analysis of Width-$w$ Non-Adjacent Forms to Imaginary Quadratic Bases

Abstract

We consider digital expansions to the base of $τ$, where $τ$ is an algebraic integer. For a $w \geq 2$, the set of admissible digits consists of 0 and one representative of every residue class modulo $τ^w$ which is not divisible by $τ$. The resulting redundancy is avoided by imposing the width $w$-NAF condition, i.e., in an expansion every block of $w$ consecutive digits contains at most one non-zero digit. Such constructs can be efficiently used in elliptic curve cryptography in conjunction with Koblitz curves. The present work deals with analysing the number of occurrences of a fixed non-zero digit. In the general setting, we study all $w$-NAFs of given length of the expansion. We give an explicit expression for the expectation and the variance of the occurrence of such a digit in all expansions. Further a central limit theorem is proved. In the case of an imaginary quadratic $τ$ and the digit set of minimal norm representatives, the analysis is much more refined: We give an asymptotic formula for the number of occurrence of a digit in the $w$-NAFs of all elements of $\Z[τ]$ in some region (e.g. a disc). The main term coincides with the full block length analysis, but a periodic fluctuation in the second order term is also exhibited. The proof follows Delange's method. We also show that in the case of imaginary quadratic $τ$ and $w \geq 2$, the digit set of minimal norm representatives leads to $w$-NAFs for \emph{all} elements of $\Z[τ]$. Additionally some properties of the fundamental domain are stated.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Clemens Heuberger, Daniel Krenn. 2012-08-03. Analysis of Width-$w$ Non-Adjacent Forms to Imaginary Quadratic Bases. https://doi.org/10.1016/j.jnt.2012.08.029

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT