相关论文: Low differentially uniform permutations from Dobbe…

The Feistel construction is a fundamental technique for building pseudorandom permutations and block ciphers. This paper shows that a simple adaptation of the construction is resistant, even to algorithm substitution attacks -- that is,…

We introduce the notion of "non-malleability" of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we demand that no controlled modification…

We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is…

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…

The paradigm of differentiable programming has significantly enhanced the scope of machine learning via the judicious use of gradient-based optimization. However, standard differentiable programming methods (such as autodiff) typically…

We discuss a new attack, termed a dimension or linear decomposition attack, on several known group-based cryptosystems. This attack gives a polynomial time deterministic algorithm that recovers the secret shared key from the public data in…

Deep Neural Networks (DNNs) are vulnerable to the black-box adversarial attack that is highly transferable. This threat comes from the distribution gap between adversarial and clean samples in feature space of the target DNNs. In this…

In this paper, we propose a novel defensive transformation that enables us to maintain a high classification accuracy under the use of both clean images and adversarial examples for adversarially robust defense. The proposed transformation…

In this article, we focus on the concept of locally-APN-ness (``APN" is the abbreviation of the well-known notion of Almost Perfect Nonlinear) introduced by Blondeau, Canteaut, and Charpin, which makes the corpus of S-boxes somehow larger…

In this paper, we study applications of Bernstein-Vazirani algorithm and present several new methods to attack block ciphers. Specifically, we first present a quantum algorithm for finding the linear structures of a function. Based on it,…

We've been able to show recently that Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers can be used to create a Diffie-Hellman-like key exchange algorithm and certificates. The cryptosystem was…

We show how any PAC learning algorithm that works under the uniform distribution can be transformed, in a blackbox fashion, into one that works under an arbitrary and unknown distribution $\mathcal{D}$. The efficiency of our transformation…

This paper introduces D2-UC, a quantum-ready framework for the unit commitment (UC) problem that prepares UC for near-term hybrid quantum-classical solvers by combining distributed classical decomposition with distributed quantum execution.…

The notion of $c$-differential uniformity has recently received a lot of attention since its proposal~\cite{Ellingsen}, and recently a characterization of perfect $c$-nonlinear functions in terms of difference sets in some quasigroups was…

The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the…

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…

Class imbalance in training datasets can lead to bias and poor generalization in machine learning models. While pre-processing of training datasets can efficiently address both these issues in centralized learning environments, it is…

A symmetric key encryption scheme is described for blocks of general size N that is a product of powers of many prime numbers. This is accomplished by realising each number (representing a message unit) as a point in a product of affine…

It was shown by Boukerrou et al.~[IACR Trans. Symmetric Cryptol. 1 (2020), 331--362] that the $F$-boomerang uniformity (which is the same as the second-order zero differential uniformity in even characteristic) of perfect nonlinear…

Very recently, a new concept called multiplicative differential and the corresponding $c$-differential uniformity were introduced by Ellingsen et al. A function $F(x)$ over finite field $\mathrm{GF}(p^n)$ to itself is called…