Related papers: On weakly APN functions and 4-bit S-Boxes
The protection of confidential information is a global issue and block encryption algorithms are the most reliable option. The famous information theorist, Claude Shannon has given two desirable characteristics that should exist in a strong…
Weak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication. While a stand-alone secure weak coin flipping protocol can be constructed…
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…
In this paper we propose a tokenization algorithm of Reversible Hybrid type, as defined in PCI DSS guidelines for designing a tokenization solution, based on a block cipher with a secret key and (possibly public) additional input. We…
We construct 8 x 8 bijective cryptographically strong S-boxes. Our construction is based on using non-bijective power functions over the finite filed.
Almost Perfect Nonlinear (APN) functions are very useful in cryptography, when they are used as S-Boxes, because of their good resistance to differential cryptanalysis. An APN function $f:\mathbb{F}_{2^n}\rightarrow\mathbb{F}_{2^n}$ is…
We investigate S-boxes defined by pairs of Orthogonal Cellular Automata (OCA), motivated by the fact that such CA always define bijective vectorial Boolean functions, and could thus be interesting for the design of block ciphers. In…
A pseudorandom code is a keyed error-correction scheme with the property that any polynomial number of encodings appear random to any computationally bounded adversary. We show that the pseudorandomness of any code tolerating a constant…
Substitution boxes (S-boxes) play a significant role in ensuring the resistance of block ciphers against various attacks. The Difference Distribution Table (DDT), the Feistel Boomerang Connectivity Table (FBCT), the Feistel Boomerang…
We study four-point correlation functions of four generic half-BPS supermultiplets of N=4 SCFT in four dimensions. We use the two-particle Casimir of four-dimensional superconformal algebra to derive superconformal blocks which contribute…
The notion of branch numbers of a linear transformation is crucial for both linear and differential cryptanalysis. The number of non-zero elements in a state difference or linear mask directly correlates with the active S-Boxes. The…
The notion of weakly separable extensions was introduced by N. Hamaguchi and A. Nakajima as a generalization of separable extensions. The purpose of this article is to give a characterization of weakly separable polynomials in skew…
Neural Networks (NN) have recently emerged as backbone of several sensitive applications like automobile, medical image, security, etc. NNs inherently offer Partial Fault Tolerance (PFT) in their architecture; however, the biased PFT of NNs…
A block cipher can be easily broken if its encryption functions can be seen as linear maps on a small vector space. Even more so, if its round functions can be seen as linear maps on a small vector space. We show that this cannot happen for…
In this article, we present a geometric theoretical analysis of semidefinite feasibility problems (SDFPs). This is done by decomposing a SDFP into smaller problems, in a way that preserves most feasibility properties of the original…
APN functions play a central role as building blocks in the design of many block ciphers, serving as optimal functions to resist differential attacks. One of the most important properties of APN functions is their linearity, which is…
We construct a weak Hilbert Banach space such that for every block subspace $Y$ every bounded linear operator on Y is of the form D+S where S is a strictly singular operator and D is a diagonal operator. We show that this yields a weak…
We present an effective set of necessary and sufficient criteria for block-positivity of matrices of order $4$ over $\mathbb{C}$. The approach is based on Sturm sequences and quartic polynomial positivity conditions presented in recent…
Most modern block ciphers are built using components whose cryptographic strength is evaluated in terms of their resistance to attacks on the whole cipher. In particular, differential properties of vectorial Boolean functions are studied…
An encryption technique is widely used to keep data confidential. Most of the block symmetric algorithms use substitution functions. Often this functions use so called S-BOX matrix. In this paper author presents one software tool for…