Polynomial Expressions of Carries in p-ary Arithmetics

It is known that any $n$-variable function on a finite prime field of characteristic $p$ can be expressed as a polynomial over the same field with at most $p^n$ monomials. However, it is not obvious to determine the polynomial for a given concrete function. In this paper, we study the concrete polynomial expressions of the carries in addition and multiplication of $p$-ary integers. For the case of addition, our result gives a new family of symmetric polynomials, which generalizes the known result for the binary case $p = 2$ where the carries are given by elementary symmetric polynomials. On the other hand, for the case of multiplication of $n$ single-digit integers, we give a simple formula of the polynomial expression for the carry to the next digit using the Bernoulli numbers, and show that it has only $(n+1)(p-1)/2 + 1$ monomials, which is significantly fewer than the worst-case number $p^n$ of monomials for general functions. We also discuss applications of our results to cryptographic computation on encrypted data.

A mathematical problem for security analysis of hash functions and pseudorandom generators

In this paper, we specify a class of mathematical problems, which we refer to as Function Density Problems (FDPs, in short), and point out novel connections of FDPs to the following two cryptographic topics; theoretical security evaluations of keyless hash functions (such as SHA-1), and constructions of provably secure pseudorandom generators (PRGs) with some enhanced security property introduced by Dubrov and Ishai [STOC 2006]. Our argument aims at proposing new theoretical frameworks for these topics (especially for the former) based on FDPs, rather than providing some concrete and practical results on the topics. We also give some examples of mathematical discussions on FDPs, which would be of independent interest from mathematical viewpoints. Finally, we discuss possible directions of future research on other cryptographic applications of FDPs and on mathematical studies on FDPs themselves.

On finite factors of centralizers of parabolic subgroups in Coxeter groups

It has been known that the centralizer $Z_W(W_I)$ of a parabolic subgroup $W_I$ of a Coxeter group $W$ is a split extension of a naturally defined reflection subgroup by a subgroup defined by a 2-cell complex $mathcal{Y}$. In this paper, we study the structure of $Z_W(W_I)$ further and show that, if $I$ has no irreducible components of type $A_n$ with $2 leq n < infty$, then every element of finite irreducible components of the inner factor is fixed by a natural action of the fundamental group of $mathcal{Y}$. This property has an application to the isomorphism problem in Coxeter groups.

On affine maps on non-compact convex sets and some characterizations of finite-dimensional solid ellipsoids

Convex geometry has recently attracted great attention as a framework to formulate general probabilistic theories. In this framework, convex sets and affine maps represent the state spaces of physical systems and the possible dynamics, respectively. In the first part of this paper, we present a result on separation of simplices and balls (up to affine equivalence) among all compact convex sets in two- and three-dimensional Euclidean spaces, which focuses on the set of extreme points and the action of affine transformations on it. Regarding the above-mentioned axiomatization of quantum physics, our result corresponds to the case of simplest (2-level) quantum system. We also discuss a possible extension to higher dimensions. In the second part, towards generalizations of the framework of general probabilistic theories and several existing results including ones in the first part from the case of compact and finite-dimensional physical systems as in most of the literatures to more general cases, we study some fundamental properties of convex sets and affine maps that are relevant to the above subject.

Short collusion-secure fingerprint codes against three pirates

In this article, we propose a new construction of probabilistic collusion-secure fingerprint codes against up to three pirates and give a theoretical security evaluation. Our pirate tracing algorithm combines a scoring method analogous to Tardos codes (J. ACM, 2008) with an extension of parent search techniques of some preceding 2-secure codes. Numerical examples show that our code lengths are significantly shorter than (about 30% to 40% of) the shortest known c-secure codes by Nuida et al. (Des. Codes Cryptogr., 2009) with c = 3. Some preliminary proposal for improving efficiency of our tracing algorithm is also given.

Locally parabolic subgroups in Coxeter groups of arbitrary ranks

Despite the significance of the notion of parabolic closures in Coxeter groups of finite ranks, the parabolic closure is not guaranteed to exist as a parabolic subgroup in a general case. In this paper, first we give a concrete example to clarify that the parabolic closure of even an irreducible reflection subgroup of countable rank does not necessarily exist as a parabolic subgroup. Then we propose a generalized notion of locally parabolic closure by introducing a notion of locally parabolic subgroups, which involves parabolic ones as a special case, and prove that the locally parabolic closure always exists as a locally parabolic subgroup. It is a subgroup of parabolic closure, and we give another example to show that the inclusion may be strict in general. Our result suggests that locally parabolic closure has more natural properties and provides more information than parabolic closure. We also give a result on maximal locally finite, locally parabolic subgroups in Coxeter groups, which generalizes a similar well-known fact on maximal finite parabolic subgroups.