相关论文: Rotational analysis of ChaCha permutation
This paper explores the partition properties of roller coaster permutations, a class of permutations characterized by maximizing the number of alternating runs in all subsequences. We establish a connection between the structure of these…
We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…
We propose two parity-based concurrent error detection schemes for the Quarterround of the ChaCha stream cipher to protect from transient and permanent faults. They offer a trade-off between implementation overhead and error coverage. The…
The ''trace reconstruction'' problem asks, given an unknown binary string $x$ and a channel that repeatedly returns ''traces'' of $x$ with each bit randomly deleted with some probability $p$, how many traces are needed to recover $x$? There…
We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…
We present a new protocol and two lower bounds for quantum coin flipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then, we show that our protocol is optimal for a certain type of quantum…
We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…
What minimum degree of a graph $G$ on $n$ vertices guarantees that the union of $G$ and a random $2$-factor (or permutation) is with high probability Hamiltonian? Gir\~ao and Espuny D{\'\i}az showed that the answer lies in the interval…
We consider a random permutation drawn from the set of 321-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{m+\ell}$ where $m$ is the…
We study the round and communication complexities of various cryptographic protocols. We give tight lower bounds on the round and communication complexities of any fully black-box reduction of a statistically hiding commitment scheme from…
In general, the CHSH inequality $S \le 2$ is considered to provide an \textit{upper} bound for classical correlations. In this note it is shown that if incoming particles are allowed to be delayed ever so briefly, the inequality can be…
Coin-flipping is a fundamental task in two-party cryptography where two remote mistrustful parties wish to generate a shared uniformly random bit. While quantum protocols promising near-perfect security exist for weak coin-flipping -- when…
The problem of distinguishing between a random function and a random permutation on a domain of size $N$ is important in theoretical cryptography, where the security of many primitives depend on the problem's hardness. We study the quantum…
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The problem of determining the mixing time of the cyclic-to-random…
The conventional rounding error analysis provides worst-case bounds with an associated failure probability and ignores the statistical property of the rounding errors. In this paper, we develop a new statistical rounding error analysis for…
We evaluate the probabilities of various events under the uniform distribution on the set of 312-avoiding permutations of 1,...,N. We derive exact formulas for the probability that the ith element of a random permutation is a specific value…
We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…
The (strong) Bruhat order for permutations provides a partial ordering defined as follows: two permutations are comparable if one can be obtained from the other by a sequence of adjacent transpositions that each increase the number of…
The interleaving of chaos and cryptography has been the aim of a large set of works since the beginning of the nineties. Many encryption proposals have been introduced to improve conventional cryptography. However, many proposals possess…
Due to the merits of high efficiency and strong security against timing and side-channel attacks, ChaCha has been widely applied in real-time communication and data streaming scenarios. However, with the rapid development of AI-assisted…