More constructions of pseudorandom lattices of \(k\) symbols (Q2350677)

The article introduces some new constructions for pseudorandom lattices with \(k\)-symbols. The case \(k=2\) has been studied by many authors, and there are deep results about the expected values of different pseudorandom measures, like well-distribution and correlation measures. As a comment, pseudorandom lattices are also known as multidimensional arrays in applications like watermarking. For positive integer numbers \(n,\;N\) and \(k\), a pseudorandom lattice is defined as a map: \[ \eta: I_{N}^n\mapsto \{1,\ldots, k\}, \] where \(I_{N}^n\) is the set of all vector with \(n\) coordinates, each of them in the set \(\{0,\ldots, N-1\}\) and \(\{1,\ldots, k\}\) are the symbols. The author first defines an equivalent pseudorandom measure called the correlation measure of order \(\ell\), which is equivalent, up to some multiplicative constants, to the one defined by \textit{L. Mérai} [Monatsh. Math. 161, No. 2, 173--191 (2010; Zbl 1281.11079)]. Using this measure, the author generalizes a construction given for the case \(k=2\) using multiplicative characters of order \(k\) of a finite field \(\mathbb{F}_q\). Then, the author introduces a new construction using additive characters which uses some additive character sum bounds by \textit{A. Winterhof} [Des. Codes Cryptography 22, No. 2, 123--131 (2001; Zbl 0995.11067)]. The last result is a combination of these two families of pseudorandom lattices to build a new families of pseudorandom lattices. The idea is to build one pseudorandom lattice \(\eta_1\) using a multiplicative character with \(k_1\) symbols and another pseudorandom lattice \(\eta_2\) using a additive character with \(k_2\) symbols. Then, identifying the set of \(k_1k_2\) symbols with the pairs \((i,j)\) where \(1\leq i\leq k_1\) and \(1\leq j\leq k_2\), it is very natural to build \(\eta\) from \(\eta_1,\eta_2\). The proof of this fact is quite technical but interesting by itself.