Related papers: A New Approach to Constructing Quadratic Pseudo-Pl…
Bent functions as optimal combinatorial objects are difficult to characterize and construct. In the literature, bent idempotents are a special class of bent functions and few constructions have been presented, which are restricted by the…
We study a new class of functions that arise naturally in quaternionic analysis, we call them "quasi regular functions". Like the well-known quaternionic regular functions, these functions provide representations of the quaternionic…
The authors define a class of functions on Riemannian manifolds, which is called geodesic semilocal E-preinvex functions, as a generalization of geodesic semilocal E-convex and geodesic semi E-preinvex functions and some of its properties…
We remark on pseudo-elliptic integrals and on exceptional function fields, namely function fields defined over an infinite base field but nonetheless containing non-trivial units. Our emphasis is on some elementary criteria that must be…
We present a new approach to constructing unconditional pseudorandom generators against classes of functions that involve computing a linear function of the inputs. We give an explicit construction of a pseudorandom generator that fools the…
We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…
In this paper we introduce and study the notion of plurisubharmonic functions in calibrated geometry. These functions generalize the classical plurisubharmonic functions from complex geometry and enjoy many of their important properties.…
Two-to-one ($2$-to-$1$) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent functions. In this paper we provide a systematic study of…
The pseudospherical functions on one-sheet, two-dimensional hyperboloid are discussed. The simplest method of construction of these functions is introduced using the Fock space structure of the representation space of the su(1,1) algebra.…
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…
In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal…
We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating function that act on the simplex tableau. In this function space,…
Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain…
Permutations over $F_{2^{2k}}$ with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well…
Let $\mathbb{F}_q$ denote the finite field of order $q$. For $q$ odd, we investigate the planarity over $\mathbb{F}_{q^3}$ of the family $$ f_{E,A,B,C,D}(X) := EX^2+ AX^{q+1}+ BX^{q^2+1}+CX^{2q} +DX^{2q^2}\in \mathbb{F}_{q}[X]. $$ Using…
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the…
This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless…
Binary field extensions are fundamental to many applications, such as multivariate public key cryptography, code-based cryptography, and error-correcting codes. Their implementation requires a foundation in number theory and algebraic…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many…