Related papers: New P$c$N and AP$c$N functions over finite fields

We study combinatorial properties of plateaued functions $F \colon \mathbb{F}_p^n \rightarrow \mathbb{F}_p^m$. All quadratic functions, bent functions and most known APN functions are plateaued, so many cryptographic primitives rely on…

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.

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…

Isotropic functions of positions $\hat{\bf r}_1, \hat{\bf r}_2,\ldots, \hat{\bf r}_N$, i.e. functions invariant under simultaneous rotations of all the coordinates, are conveniently formed using spherical harmonics and Clebsch-Gordan…

We give some coefficient bounds and distortion theorems for a subclass of univalent functions in the unit disk, and defined using the S\^{a}l\^{a}gean differential operator. The results generalize and unify some well known results for…

Maximum nonlinear functions on finite fields are widely used in cryptography because the coordinate functions have large distance to linear functions. More precisely, the Hamming distance to the characteristic functions of hyperplanes is…

We consider a broad class of Approximate Message Passing (AMP) algorithms defined as a Lipschitzian functional iteration in terms of an $n\times n$ random symmetric matrix $A$. We establish universality in noise for this AMP in the…

Upper and lower quantum functionals, introduced by Christandl, Vrana and Zuiddam (STOC 2018, J. Amer. Math. Soc. 2023), are families of monotone functions of tensors indexed by a weighting on the set of subsets of the tensor legs. Inspired…

In literature, it is common to find problems which require a way to encode a finite set of information into a single data; usually means are used for that. An important generalization of means are the so called Aggregation Functions, with a…

In this work we study $p$-adic continuous functions in several variables taking values on $\mathbb{Z}_p$. We describe the orthonormal van der Put base of these functions and study various Lipschitz conditions in several variables,…

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…

A compression function is a map that slims down an observational set into a subset of reduced size, while preserving its informational content. In multiple applications, the condition that one new observation makes the compressed set change…

This paper provides a unifying view of a wide range of problems of interest in machine learning by framing them as the minimization of functionals defined on the space of probability measures. In particular, we show that generative…

Based on our previous work on truly concurrent process algebras APTC, we use it to verify the security protocols. This work (called Secure APTC, abbreviated SAPTC) have the following advantages in verifying security protocols: (1) It has a…

In this paper a small survey is presented on eighteen new functions and four new sequences, such as: Inferior/Superior f-Part, Fractional f-Part, Complementary function with respect with another function, S-Multiplicative, Primitive…

This paper presents how to make use of the advantage of round-off error effect in some research areas. The float-point operation complies with the reproduce theorem without the external random perturbation. The computation uncertainty…

A language L is low for a relativizable complexity class C, if C$^L$ = C. For the classes #P, GapP, and SpanP the exact low classes of languages are known: Low(#P) = UP $\cap$ coUP, Low(GapP) = SPP, and Low(SpanP) = NP $\cap$ coNP. In this…

The Walsh transform $\widehat{Q}$ of a quadratic function $Q:F_{p^n}\rightarrow F_p$ satisfies $|\widehat{Q}(b)| \in \{0,p^{\frac{n+s}{2}}\}$ for all $b\in F_{p^n}$, where $0\le s\le n-1$ is an integer depending on $Q$. In this article, we…

Mathematical definitions of polyhedrons and perceptron networks are discussed. The formalization of polyhedrons is done in a rather traditional way. For networks, previously proposed systems are developed. Perceptron networks in disjunctive…

This paper proposes an adaptive auxiliary task learning based approach for object counting problems. Unlike existing auxiliary task learning based methods, we develop an attention-enhanced adaptively shared backbone network to enable both…