Related papers: Sidon sets and statistics of the ElGamal function

A permutation graph $G_\pi$ is a simple graph with vertices corresponding to the elements of $\pi$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $\pi$. A set of vertices $D$ is said to dominate a graph $G$ when every…

A theorem of Leibman asserts that a polynomial orbit $(g(1),g(2),g(3),\ldots)$ on a nilmanifold $G/\Gamma$ is always equidistributed in a union of closed sub-nilmanifolds of $G/\Gamma$. In this paper we give a quantitative version of…

We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…

It is an important fact that extremal discrete structures -- that is, discrete structures of maximal size among those that avoid certain configurations -- exhibit strong pseudorandom behavior. We present instances of this phenomenon in the…

Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To this end we construct a set of models $\cal M$, a common…

Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…

For a finite-dimensional representation V of a group G we introduce and study the notion of a Lie element in the group algebra k[G]. The set L(V) \subset k[G] of Lie elements is a Lie algebra and a G-module acting on the original…

In this paper, we introduce a new notion called the \textit{set of missing generators} $\mathcal{M}(g)$ for a generator (or primitive element) $g$ of the cyclic group $\mathbb{Z}_p^*$, where $p$ is an odd prime. The cardinality of…

In this paper we consider cryptographic applications of the arithmetic on the hyperoctahedral group. On an appropriate subgroup of the latter, we particularly propose to construct public key cryptosystems based on the discrete logarithm.…

Let $p$ be a prime and $G$ a pro-$p$ group of finite rank that admits a faithful, self-similar action on the $p$-ary rooted tree. We prove that if the set $\{g\in G \ | \ g^{p^n}=1\}$ is a nontrivial subgroup for some $n$, then $G$ is a…

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

We classify compact Riemann surfaces of genus $g$, where $g-1$ is a prime $p$, which have a group of automorphisms of order $\rho(g-1)$ for some integer $\rho\ge 1$, and determine isogeny decompositions of the corresponding Jacobian…

Given a prime $p$, an elliptic curve $\E/\F_p$ over the finite field $\F_p$ of $p$ elements and a binary \lrs\ $\(u(n)\)_{n =1}^\infty$ of order~$r$, we study the distribution of the sequence of points $$ \sum_{j=0}^{r-1} u(n+j)P_j, \qquad…

Let $g$, $h$ be a random pair of generators of $G=Sym(n)$ or $G=Alt(n)$. We show that, with probability tending to $1$ as $n\to \infty$, (a) the diameter of $G$ with respect to $S = \{g,h,g^{-1},h^{-1}\}$ is at most $O(n^2 (\log n)^c)$, and…

As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is…

Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…

We define a cipher that is an extension of GOST, and study the permutation group generated by its round functions. We show that, under minimal assumptions on the components of the cipher, this group is the alternating group on the plaintext…

Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the first type are permutations turning the order upside down, and…

In this note, we study the easy certificate classes introduced by Hemaspaandra, Rothe, and Wechsung, with regard to the question of whether or not surjective one-way functions exist. This is an important open question in cryptology. We show…

There are many deep results on the structure of REGULAR probability measures $P(G)$ on compact/locally compact, Hausdorff topological groups G. See, for instance, the classic monographs by KR Parthasarathy, Ulf Grenander, A.Mukherjea and…