Related papers: On weakly APN functions and 4-bit S-Boxes
This paper approaches, using structural complexity theory, the question of whether there is a chasm between knowing an object exists and getting one's hands on the object or its properties. In particular, we study the nontransparency of…
The use of neural networks as function approximators has enabled many advances in reinforcement learning (RL). The generalization power of neural networks combined with advances in RL algorithms has reignited the field of artificial…
The problem is related to all-or-nothing transforms (AONT) suggested by Rivest as a preprocessing for encrypting data with a block cipher. Since then there have been various applications of AONTs in cryptography and security. D'Arco,…
We prove that a finite braided tensor category A is invertible in the Morita 4-category BrTens of braided tensor categories if, and only if, it is non-degenerate. This includes the case of semisimple modular tensor categories, but also…
We argue that weak containment is an appropriate notion of amenability for inverse semigroups. Given an inverse semigroup $S$ and a homomorphism $\phi$ of $S$ onto a group $G$, we show, under an assumption on $\ker(\phi)$, that $S$ has weak…
This paper formally proposes a problem about the efficient utilization of the four dimensional space-time. Given a cuboid container, a finite number of rigid cuboid items, and the time length that each item should be continuous baked in the…
Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and…
Mochon's proof [Moc07] of existence of quantum weak coin flipping with arbitrarily small bias is a fundamental result in quantum cryptography, but at the same time one of the least understood. Though used several times as a black box in…
For any JdLG-admissible representation $\pi$ of a semigroup $S$ on a Banach space $E$, we show that the reversible part is weakly equivalent to a unitary representation on a Hilbert space that decomposes into a direct sum of finite…
It has been suggested that the algebraic structure of AES (and other similar block ciphers) could lead to a weakness exploitable in new attacks. In this paper, we use the algebraic structure of AES-like ciphers to construct a cipher…
Irreducible polynomials play an important role till now, in construction of 8-bit S-Boxes in ciphers. The 8-bit S-Box of Advanced Encryption Standard is a list of decimal equivalents of Multiplicative Inverses (MI) of all the elemental…
We investigate the issues of achieving sufficient rigor in the arguments for the safety of machine learning functions. By considering the known weaknesses of DNN-based 2D bounding box detection algorithms, we sharpen the metric of imprecise…
Spiking Neural Networks (SNNs), the third generation neural networks, are known for their low energy consumption and high robustness. SNNs are developing rapidly and can compete with Artificial Neural Networks (ANNs) in many fields. To…
APN functions play a fundamental role in cryptography against attacks on block ciphers. Several families of quadratic APN functions have been proposed in the recent years, whose construction relies on the existence of specific families of…
We define a new class of rings parameterized by binary forms of a certain type, and give an effective lower bound for the number of such rings whose discriminant is less than a bound $X$. We also obtain a lower bound for the number of…
The aim of the present paper is to define a notion of weakly differentiable cochain in the generality of metric measure spaces and to study basic properties of such cochains. Our cochains are (sub-)linear functionals on a subspace of…
We introduce the notion of a weakly reflective submanifold, which is an austere submanifold with a certain global condition, and study its fundamental properties. Using these, we determine weakly reflective orbits and austere orbits of…
Traditional cryptography is suffering a huge threat from the development of quantum computing. While many currently used public-key cryptosystems would be broken by Shor's algorithm, the effect of quantum computing on symmetric ones is…
We consider a class of fourth order elliptic systems which include the Euler-Lagrange equations of biharmonic mappings in dimension 4 and we prove that weak limit of weak solutions to such systems is again a weak solution to a limit system.
The problem of combating de-coherence by weak measurements has already been studied for the amplitude damping channel and for specific input states. We generalize this to a large four-parameter family of qubit channels and for the average…