Related papers: More Constructions of Differentially 4-uniform Per…
We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…
Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…
I continue the investigation of a q-analogue of the convolution on the line started in a joint work with Koornwinder and based on a formal definition due to Kempf and Majid. Two different ways of approximating functions by means of the…
Let $\gf_{p^n}$ denote the finite field containing $p^n$ elements, where $n$ is a positive integer and $p$ is a prime. The function $f_u(x)=x^{\frac{p^n+3}{2}}+ux^2$ over $\gf_{p^n}[x]$ with $u\in\gf_{p^n}\setminus\{0,\pm1\}$ was recently…
In this paper, we investigate permutation rotation-symmetric (shift-invariant) vectorial Boolean functions on $n$ bits that are liftings from Boolean functions on $k$ bits, for $k\leq n$. These functions generalize the well-known map used…
Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root…
In this paper, we study different cryptographically significant spectra of Boolean functions, including the Walsh-Hadamard, cross-correlation, and autocorrelation. The $2^k$-variation by Stanica [IEEE-IT 2016] is considered here with 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…
We investigate shift-invariant transformations, also known as rotation-symmetric vectorial Boolean functions, on $n$ bits that are induced from Boolean functions on $k$ bits, for $k\leq n$. We consider such transformations that are not…
By using a new way to encode Boolean functions in a reversible gate, an algorithm is developed in quantum computing over Z_2, symbolized QC/2, (as opposed to QC over C) that needs only one function evaluation to solve the Grover Database…
This paper analyzes three forms of representation of Boolean functions, such as Classical, Algebraic and Reed-Muller. The concept of intersection and subsets of representation forms have been introduced, moreover suitable criteria for…
We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…
Substitution Box or S-Box had been generated using 4-bit Boolean Functions (BFs) for Encryption and Decryption Algorithm of Lucifer and Data Encryption Standard (DES) in late sixties and late seventies respectively. The S-box of Advance…
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular…
A block cipher is intended to be computationally indistinguishable from a random permutation of appropriate domain and range. But what are the properties of a random permutation? By the aid of exponential and ordinary generating functions,…
Polynomial functions on the group of units Q_n of the ring Z_{2^n} are considered. A finite set of reduced polynomials RP_n in Z[x] that induces the polynomial functions on Q_n is determined. Each polynomial function on Q_n is induced by a…
$ n-$cycle permutation polynomials with small n have the advantage that their compositional inverses are efficient in terms of implementation. These permutation polynomials have significant applications in cryptography and coding theory. In…
We present a conceptual framework for extending homomorphic encryption beyond arithmetic or Boolean operations into the domain of intuitionistic logic proofs and, by the Curry-Howard correspondence, into the domain of typed functional…
We show that the there exists an infinite family of APN functions of the form $F(x)=x^{2^{s}+1} + x^{2^{k+s}+2^k} + cx^{2^{k+s}+1} + c^{2^k}x^{2^k + 2^s} + \delta x^{2^{k}+1}$, over $\gf_{2^{2k}}$, where $k$ is an even integer and…