相关论文: On weakly APN functions and 4-bit S-Boxes

The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a…

Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…

Spiking Neural Networks (SNNs) claim to present many advantages in terms of biological plausibility and energy efficiency compared to standard Deep Neural Networks (DNNs). Recent works have shown that DNNs are vulnerable to adversarial…

Hundreds of defenses have been proposed to make deep neural networks robust against minimal (adversarial) input perturbations. However, only a handful of these defenses held up their claims because correctly evaluating robustness is…

Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secret-key block ciphers. This choice directly induces the classical version of the differential attack by the use of…

Polar codes are usually constructed by ranking synthetic bit-channels according to reliability, which guarantees capacity-achieving behavior but can yield poor low-weight spectra at short and moderate lengths. Recent algebraic results…

In this paper we prove a collection of results on the structure of permutations in the Clifford Hierarchy. First, we leverage results from the cryptography literature on affine equivalence classes of 4-bit permutations which we use to find…

Reversible logic has attracted substantial interest due to its low power consumption which is the main concern of low power VLSI circuit design. In this paper, a novel 4x4 reversible gate called inventive gate has been introduced and using…

Over recent years, devising classification algorithms that are robust to adversarial perturbations has emerged as a challenging problem. In particular, deep neural nets (DNNs) seem to be susceptible to small imperceptible changes over test…

It has been established that training a box-based detector network can enhance the localization performance of weakly supervised and unsupervised methods. Moreover, we extend this understanding by demonstrating that these detectors can be…

Universal algebra and clone theory have proven to be a useful tool in the study of constraint satisfaction problems since the complexity, up to logspace reductions, is determined by the set of polymorphisms of the constraint language. For…

Adversarial attack methods have demonstrated the fragility of deep neural networks. Their imperceptible perturbations are frequently able fool classifiers into potentially dangerous misclassifications. We propose a novel way to interpret…

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…

We present new invariants, APN-extendibility criterion and a backtracking approach to identify several numerical facts supporting the conjecture that the set of 6-bit \APN functions is limited to 14 CCZ-classes.

We consider mixed four-point correlators of 1/2-BPS operators $\phi_{k}$ in SCFTs with eight real Poincar\'e supercharges, namely the 3d $\mathcal{N}=4$, 4d $\mathcal{N}=2$, 5d $\mathcal{N}=1$, and 6d $\mathcal{N}=(1,0)$ theories. Using the…

We present a top-down lower-bound method for depth-$4$ boolean circuits. In particular, we give a new proof of the well-known result that the parity function requires depth-$4$ circuits of size exponential in $n^{1/3}$. Our proof is an…

We propose a new symmetric cryptographic scheme based on functional invariants defined over discrete oscillatory functions with hidden parameters. The scheme encodes a secret integer through a four-point algebraic identity preserved under…

Differential cryptanalysis is one of the most popular methods in attacking block ciphers. However, there still some limitations in traditional differential cryptanalysis. On the other hand, researches of quantum algorithms have made great…

Weakly supervised object detection aims at learning precise object detectors, given image category labels. In recent prevailing works, this problem is generally formulated as a multiple instance learning module guided by an image…

Weak measurements are a new tool for characterizing post-selected quantum systems during their evolution. Weak measurement was originally formulated in terms of von Neumann interactions which are practically available for only the simplest…