Jörg M. Thuswaldner

Learn More
Several cryptosystems rely on fast calculations of linear combinations in groups. One way to achieve this is to use joint signed binary digit expansions of small “weight.” We study two algorithms, one based on nonadjacent forms of the coefficients of the linear combination, the other based on a certain joint sparse form specifically adapted to(More)
Shift radix systems form a collection of dynamical systems depending on a parameter r which varies in the d-dimensional real vector space. They generalize well-known numeration systems such as beta-expansions, expansions with respect to rational bases, and canonical number systems. Beta-numeration and canonical number systems are known to be intimately(More)
We study aperiodic and periodic tilings induced by the Rauzy fractal and its subtiles associated to beta-substitutions related to the polynomial x 3 − ax 2 − bx − 1 for a ≥ b ≥ 1. In particular, we compute the corresponding boundary graphs, describing the adjacencies in the tilings. These graphs are a valuable tool for more advanced studies of the(More)
Let Fq be a finite field with q elements and p ∈ Fq[X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the ring Fq[X, Y ]/p Fq[X, Y ]. Our results comprise distribution results, exponential sum estimations as well as a version of Waring's Problem restricted by such additive functions. Similar(More)
Let k = Q(√ −D) be an imaginary quadratic number field with ring of integers Z k and let k(α) be the cubic extension of k generated by the polynomial f t (x) = x 3 − (t − 1)x 2 − (t + 2)x − 1 with t ∈ Z k. In the present paper we characterize all elements γ ∈ Z k [α] with norms satisfying |N k(α)/k | ≤ |2t + 1| for |t| ≥ 14. This generalizes a corresponding(More)
  • 1