Related papers: On generalizing cryptographic results to Sidon set…

Linear-programming pseudocodewords play a pivotal role in our understanding of the linear-programming decoding algorithms. These pseudocodewords are known to be equivalent to the graph-cover pseudocodewords. The latter pseudocodewords, when…

Let $W$ be a finite reflection group, either real or complex, and $S_\ell$ a Sylow $\ell$-subgroup of $W$. We prove the existence of a semidirect product decomposition of $N_W(S_\ell)$ in terms of the unique parabolic subgroup of $W$…

Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the known constructions via finite fields make use of the…

The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almost perfect…

A subset of the integer planar grid $[N] \times [N]$ is called corner-free if it contains no triple of the form $(x,y), (x+\delta,y), (x,y+\delta)$. It is known that such a set has a vanishingly small density, but how large this density can…

A system of linear equations in $\mathbb{F}_p^n$ is \textit{Sidorenko} if any subset of $\mathbb{F}_p^n$ contains at least as many solutions to the system as a random set of the same density, asymptotically as $n\to \infty$. A system of…

One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…

In conic linear programming -- in contrast to linear programming -- the Lagrange dual is not an exact dual: it may not attain its optimal value, or there may be a positive duality gap. The corresponding Farkas' lemma is also not exact (it…

A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation…

The semidirect discrete logarithm problem (SDLP) in finite groups was proposed as a foundation for post-quantum cryptographic protocols, based on the belief that its non-abelian structure would resist quantum attacks. However, recent…

We show that the classical Szasz analytic function $S_N(f)(x)$ is obtained by applying the pseudo-differential operator $f(N^{-1}D_{\theta})$ to the Bergman kernels for the Bargmann-Fock space. The expression generalizes immediately to any…

Constructing permutation polynomials over finite fields, particularly those with simple algebraic structure in multiple variables, is a fundamental problem with applications in cryptography and coding theory. Recently, Li and Kaleyski (IEEE…

In this paper we study the problem of finding a small safe set $S$ in a graph $G$, i.e. a non-empty set of vertices such that no connected component of $G[S]$ is adjacent to a larger component in $G - S$. We enhance our understanding of the…

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

We prove, when $S$ is a $2$-group of order at most $2^9$, that each reduced fusion system over $S$ is the fusion system of a finite simple group and is tame. It then follows that each saturated fusion system over a $2$-group of order at…

Boolean functions with few-valued spectra have wide applications in cryptography, coding theory, sequence designs, etc. In this paper, we further study the parametric construction approach to obtain balanced Boolean functions using…

For positive integers $d$ and $n$, let $[n]^d$ be the set of all vectors $(a_1,a_2,\dots, a_d)$, where $a_i$ is an integer with $0\leq a_i\leq n-1$. A subset $S$ of $[n]^d$ is called a \emph{Sidon set} if all sums of two (not necessarily…

Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is to construct binary linear codes with few weights from the…

For a given graph $G = (V, E)$, a subset of the vertices $D\subseteq V$ is called a semitotal dominating set, if $D$ is a dominating set and every vertex $v \in D$ is within distance two to another witness $v' \in D$. We want to find a…

Let us denote elements of the symmetric group $S_n$ using square brackets for the one-line notation. Cycles will be represented using parentheses, following the standard cycle notation. Under this convention, the full reversal of the…