相关论文: Rotational analysis of ChaCha permutation
A number of fields, including the study of genome rearrangements and the design of interconnection networks, deal with the connected problems of sorting permutations in "as few moves as possible", using a given set of allowed operations, or…
This paper investigates a joint source-channel secrecy problem for the Shannon cipher broadcast system. We suppose list secrecy is applied, i.e., a wiretapper is allowed to produce a list of reconstruction sequences and the secrecy is…
We introduce the swap-or-not shuffle and show that the technique gives rise to a new method to convert a pseudorandom function (PRF) into a pseudorandom permutation (PRP) (or, alternatively, to directly build a confusion/diffusion…
This report presents new four-round integral properties against the Rijndael cipher with block sizes larger than 128 bits. Using higher-order multiset distinguishers and other well-known extensions of those properties, the deduced attacks…
The random-cluster model is a unifying framework for studying random graphs, spin systems and electrical networks that plays a fundamental role in designing efficient Markov Chain Monte Carlo (MCMC) sampling algorithms for the classical…
We study first-passage percolation in two dimensions, using measures mu on passage times with b:=inf supp(mu) >0 and mu({b})=p \geq p_c, the threshold for oriented percolation. We first show that for each such mu, the boundary of the limit…
We study the quantum security of key-alternating ciphers (KAC), a natural multi-round generalization of the Even--Mansour construction. KAC abstracts the round structure of practical block ciphers as public permutations interleaved with key…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
We have generalized the idea of backbend in a nearest-neighbor oriented bond percolation process by considering a backbend sequence $\beta : \mathbb{Z}_+ \to \mathbb{Z}_+ \cup \{\infty\}$, and defining a $\beta$-backbend path from the…
We derive two probabilistic bounds for the relative forward error in the floating point summation of $n$ real numbers, by representing the roundoffs as independent, zero-mean, bounded random variables. The first probabilistic bound is based…
The problem of a diffusing particle moving among diffusing traps is analyzed in general space dimension d. We consider the case where the traps are initially randomly distributed in space, with uniform density rho, and derive upper and…
A crossing probability for the critical four-state Potts model on an $L\times M$ rectangle on a square lattice is numerically studied. The crossing probability here denotes the probability that spin clusters cross from one side of the…
We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…
In this article we study a small random perturbation of a linear recurrence equation. If all the roots of its corresponding characteristic equation have modulus strictly less than one, the random linear recurrence goes exponentially fast to…
Consider the following Markov chain on permutations of length $n$. At each time step we choose a random position. If the letter at that position is smaller than the letter immediately to the left (cyclically) then these letters swap…
Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the…
On the square lattice raindrops fall on an edge with midpoint $x$ at rate $\|x\|_\infty^{-\alpha}$. The edge becomes open when the first drop falls on it. Let $\rho(x,t)$ be the probability that the edge with midpoint $x=(x_1,x_2)$ is open…
We present a quantum circuit that implements the random dilation superchannel, transforming parallel queries of an unknown quantum channel into the same number of parallel queries of a randomly chosen dilation isometry of the input channel.…
We show a $n^2 \cdot 2^{n/2}$ upper bound on the number of $(132,213)$ avoiding cyclic permutations. This is the first nontrivial upper bound on the number of such permutations. We also construct an algorithm to determine whether a…
In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…