相关论文: Rotational analysis of ChaCha permutation

We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $P$, the shortest-path distance from $s$ to $t$ avoiding $e$.…

A combinatorial object is said to be quasirandom if it exhibits certain properties that are typically seen in a truly random object of the same kind. It is known that a permutation is quasirandom if and only if the pattern density of each…

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

In this paper, we revisit the Recursive Projection-Aggregation (RPA) decoder, of Ye and Abbe (2020), for Reed-Muller (RM) codes. Our main contribution is an explicit upper bound on the probability of incorrect decoding, using the RPA…

We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…

We study the fundamental communication limits of information-theoretic secure aggregation in a hierarchical network consisting of a server, multiple relays, and multiple users per relay. Communication proceeds over two rounds and two hops,…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

We study random unitary channels which reproduce the action of the twirling channel corresponding to the representation of the symmetric groupon an n-fold tensor product. We derive upper andlower bounds on the randomness cost of…

We prove a lower bound on the probability of Shor's order-finding algorithm successfully recovering the order $r$ in a single run. The bound implies that by performing two limited searches in the classical post-processing part of the…

We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…

We consider the random evolution described by the motion of a particle moving on a circle alternating the angular velocities $ \pm c $ and changing rotation at Poisson random times, resulting in a telegraph process over the circle. We study…

We show that the spectral radius of an $N\times N$ random symmetric matrix with i.i.d. bounded centered but non-symmetrically distributed entries is bounded from above by $ 2 \*\sigma + o(N^{-6/11+\epsilon}), $ where $\sigma^2 $ is the…

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

Given a graph $\Gamma$, its auxiliary \emph{square-graph} $\square(\Gamma)$ is the graph whose vertices are the non-edges of $\Gamma$ and whose edges are the pairs of non-edges which induce a square (i.e., a $4$-cycle) in $\Gamma$. We…

We have found analytical expressions (polynomials) of the percolation probability for site percolation on a square lattice of size $L \times L$ sites when considering a plane (the crossing probability in a given direction), a cylinder…

We present new algorithms for estimating and testing \emph{collision probability}, a fundamental measure of the spread of a discrete distribution that is widely used in many scientific fields. We describe an algorithm that satisfies…

In the era of digitization secure transmission of digital images has become essential in real world applications. Image encryption is an effective technique for protecting image data from unauthorized access. The security of encrypted data…

A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…

Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest players' cheating. Finding the optimal security…

In this article we show for the first time that quantum coin flipping with security guarantees that are strictly better than any classical protocol is possible to implement with current technology. Our protocol takes into account all…