Related papers: Low Ambiguity in Strong, Total, Associative, One-W…
A hash function is constructed based on a three-layer neural network. The three neuron-layers are used to realize data confusion, diffusion and compression respectively, and the multi-block hash mode is presented to support the plaintext…
We prove some sharp Hardy inequalities for domains with a spherical symmetry. In particular, we prove an inequality for domains of the unit $n$-dimensional sphere with a point singularity, and an inequality for functions defined on the…
In this paper, strongly $(\alpha,T)$-convex functions, i.e., functions $f:D\to \R$ satisfying the functional inequality $$ f(tx+(1-t)y)\leq tf(x)+(1-t)f(y)-t\alpha\big((1-t)(x-y)\big)-(1-t)\alpha\big(t(y-x)\big)$$ for $x,y\in D$ and $t\in…
We show that there exists an oracle relative to which quantum commitments exist but no (efficiently verifiable) one-way state generators exist. Both have been widely considered candidates for replacing one-way functions as the minimal…
In this paper, we prove a version of the typed B\"ohm theorem on the linear lambda calculus, which says, for any given types A and B, when two different closed terms s1 and s2 of A and any closed terms u1 and u2 of B are given, there is a…
We give a unateness tester for functions of the form $f:[n]^d\rightarrow R$, where $n,d\in \mathbb{N}$ and $R\subseteq \mathbb{R}$ with query complexity $O(\frac{d\log (\max(d,n))}{\epsilon})$. Previously known unateness testers work only…
Consider the following two fundamental open problems in complexity theory: (a) Does a hard-on-average language in NP imply the existence of one-way functions?, or (b) Does a hard-on-average language in NP imply a hard-on-average problem in…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…
A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work is the necessity of a broadcast channel for securely…
A function $U:\left[ \omega_{1}\right] ^{2}\longrightarrow\omega$ is called $\left( 1,\omega_{1}\right) $\emph{-weakly universal }if for every function $F:\left[ \omega_{1}\right] ^{2}\longrightarrow\omega$ there is an injective function…
Let $\Omega^o$ and $\Omega^i$ be open bounded subsets of $\mathbb{R}^n$ of class $C^{1,\alpha}$ such that the closure of $\Omega^i$ is contained in $\Omega^o$. Let $f^o$ be a function in $C^{1,\alpha}(\partial\Omega^o)$ and let $F$ and $G$…
We construct a H\"older continuous function on the unit interval which coincides in uncountably (in fact continuum) many points with every function of total variation smaller than 1 passing through the origin. We say that a function with…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…
In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…
In this short note we prove that, if (C[a,b],{A_n}) is an approximation scheme and (A_n) satisfies de La Vall\'ee-Poussin Theorem, there are instances of continuous functions on [a,b], real analytic on (a,b], which are poorly approximable…
Strong converse theorems refer to the study of impossibility results in information theory. In particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum hypothesis testing [Comm. Math. Phys, 334(3), 2014], which…
We establish weak-type $(1,1)$ bounds for the maximal function associated with ergodic averaging operators modeled on a wide class of thin deterministic sets $B$. As a corollary we obtain the corresponding pointwise convergence result on…
Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher. In this paper, we propose a large class of weightwise perfectly…