相关论文: Rotational analysis of ChaCha permutation

We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier estimates in moderate ranges. For example, with random numbers to $2^{200}$, our results improve on prior…

We study the problem of reaching agreement in a synchronous distributed system by $n$ autonomous parties, when the communication links from/to faulty parties can omit messages. The faulty parties are selected and controlled by an adaptive,…

In this paper we study bond percolation on a one-dimensional chain with power-law bond probability $C/ r^{1+\sigma}$, where $r$ is the distance length between distinct sites. We introduce and test an order $N$ Monte Carlo algorithm and we…

We present a quantum protocol for the task of weak coin flipping. We find that, for one choice of parameters in the protocol, the maximum probability of a dishonest party winning the coin flip if the other party is honest is 1/sqrt(2). We…

A Chaitin Omega number is the halting probability of a universal Chaitin (self-delimiting Turing) machine. Every Omega number is both computably enumerable (the limit of a computable, increasing, converging sequence of rationals) and random…

Fitting percolation into the conformal field theory framework requires showing that connection probabilities have a conformally invariant scaling limit. For critical site percolation on the triangular lattice, we prove that the probability…

We present computer simulations to examine probability distributions of gyration radius for the no-thickness closed polymers of N straight segments of equal length. We are particularly interested in the conditional distributions when the…

The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such…

For over a decade now we have been witnessing the success of {\em massive parallel computation} (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for their success is the fact that these frameworks are able to…

The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the…

In the permutation inversion problem, the task is to find the preimage of some challenge value, given oracle access to the permutation. This is a fundamental problem in query complexity, and appears in many contexts, particularly…

The size of rings (also called cyclic polymers) in bidisperse blends of chemically identical rings is analyzed by computer simulations. Data of entangled ring blends and blends of interpenetrating rings are compared and it is shown that the…

Quantum particles can penetrate potential barriers by tunneling (1). If that barrier is rotating, the tunneling process is modified (2,3). This is typical for electrons in atoms, molecules or solids exposed to strong circularly polarized…

We introduce a scalable searching algorithm for finding nodes and contents in random networks with Power-Law (PL) and heavy-tailed degree distributions. The network is searched using a probabilistic broadcast algorithm, where a query…

Trace reconstruction is the problem of learning an unknown string $x$ from independent traces of $x$, where traces are generated by independently deleting each bit of $x$ with some deletion probability $q$. In this paper, we initiate the…

The transfer algorithm~\cite{jiang} solves the on-chain one-hop swap routing problem. In \cite{jiang}, the convergence is proved but the convergence rate is left open. We prove that the algorithm terminates in at most…

The circular peak set of a permutation $\sigma$ is the set $\{\sigma(i)\mid \sigma(i-1)<\sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of…

In this paper, we study Ruelle's probability cascades in the framework of time-inhomogeneous fragmentation processes. We describe Ruelle's cascades mechanism exhibiting a family of measures $(\nu_t,t\in [0,1[)$ that characterizes its…

We consider the randomized decision tree complexity of the recursive 3-majority function. We prove a lower bound of $(1/2-\delta) \cdot 2.57143^h$ for the two-sided-error randomized decision tree complexity of evaluating height $h$ formulae…

We show that counting the number of collisions (re-sampled bitstrings) when measuring a random quantum circuit provides a practical benchmark for the quality of a quantum computer and a quantitative noise characterization method. We…