# Realistic Analysis of Some Randomized Algorithms

@article{Bach1991RealisticAO, title={Realistic Analysis of Some Randomized Algorithms}, author={E. Bach}, journal={J. Comput. Syst. Sci.}, year={1991}, volume={42}, pages={30-53} }

Abstract Many problems such as primality testing can be solved efficiently using a source of independent, identically distributed random numbers. It is therefore customary in the theory of algorithms to assume the availability of such a source. However, probabilistic algorithms often work well in practice with pseudo-random numbers; the purpose of this paper is to offer a justification for this fact. The results below apply to sequences generated by iteratively applying functions of the form f… Expand

#### Topics from this paper

#### 11 Citations

On randomization in sequential and distributed algorithms

- Computer Science
- CSUR
- 1994

This survey presents five techniques that have been widely used in the design of randomized algorithms, illustrated using 12 randomized algorithms that span a wide range of applications, including:primality testing, interactive probabilistic proof systems, dining philosophers, and Byzantine agreement. Expand

Improvements on the Cantor-Zassenhaus Factorization Algorithm

- Mathematics
- 2010

The paper presents a careful analysis of the Cantor-Zassenhaus polynomial factorization algorithm, thus obtaining tight bounds on the performances, and proposing useful improvements. In particular, a… Expand

On the Security of Pseudorandomized Information-Theoretically Secure Schemes

- Computer Science
- ICITS
- 2009

It is shown that Dubrov and Ishai's argument that randomness in a protocol can be replaced with pseudorandomness in an indistinguishable way for an adversary even if his algorithm has unbounded complexity, and a novel evaluation technique is proposed that is effective for those more general protocols. Expand

Efficient Algorithms for Computing the Jacobi Symbol

- Mathematics, Computer Science
- ANTS
- 1996

Two new algorithms for computing the Jacobi Symbol are presented: the right-shift and left-shift k-ary algorithms, which are asymptotically faster than the traditional algorithm, which is based in Euclid's algorithm for computing greatest common divisors. Expand

Elliptic Curve Cryptosystems: A Survey

- Mathematics
- 1998

Elliptic curves have been a subject of much mathematical study since early in the past century. Recently, through the work of Koblitz and Miller. they have found application in the area of publickey… Expand

Algorithms for Generating, Testing and Proving Primes: A Survey

- Computer Science
- 2001

Methods of testing and proving primality and their implementation for generation of cryptographic primes are surveyed and the focus is on criteria for practical use. Expand

Models of Computation, Riemann Hypothesis, and Classical Mathematics

- Computer Science
- SOFSEM
- 1998

The latest decades have brought us evidence that computer people will soon study quantum physics and modern biology just to understand what computers are doing. Expand

Security of Biased Sources for Cryptographic Keys

- Computer Science
- 2001

Deviations from uniform distribution of the key source may be regarded a priori as a potential security breach, even if no dedicated attack is known, which might take advantage of these deviations. Expand

A survey for approximation algorithms for the permanent

- Mathematics
- 1990

In this paper we give a survey of recent work on the problem of approximating the permanent.

Number-Theoretic Algorithms

- Mathematics
- 1990

Computation Theory . . Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . .… Expand

#### References

SHOWING 1-10 OF 24 REFERENCES

On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms

- Mathematics, Computer Science
- Inf. Comput.
- 1987

Abstract We show the existence of nonuniform schemes for the following sampling problem: Given a sample space with n points, an unknown set of size n 2 , and s random points, it is possible to… Expand

Almost all primes can be quickly certified

- Mathematics, Computer Science
- STOC '86
- 1986

A new probabilistie primality test is presented, different from the tests of Miller, Solovay-Strassen, and Rabin in that its assertions of primality are certain, rather than being correct with high probability or dependent on an unproven assumption. Expand

Analytic methods in the analysis and design of number-theoretic algorithms

- Mathematics
- 1985

This book makes a substantial contribution to the understanding of a murky area of number theory that is important to computer science, an area relevant to the design and analysis of number-theoretic… Expand

Probabilistic algorithm for testing primality

- Mathematics
- 1980

Abstract We present a practical probabilistic algorithm for testing large numbers of arbitrary form for primality. The algorithm has the feature that when it determines a number composite then the… Expand

Evaluation and Comparison of Two Efficient Probabilistic Primality Testing Algorithms

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1980

This work analyzes two recent probabilistic primality testing algorithms, derived from Miller in a formulation given by Rabin and Solovay and Strassen, and shows that the first algorithm is always more efficient than the second, both in Probabilistic and algorithmic terms. Expand

How to generate cryptographically strong sequences of pseudo random bits

- Mathematics, Computer Science
- 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
- 1982

A general algorithmic scheme for constructing polynomial-time deterministic algorithms that stretch a short secret random input into a long sequence of unpredictable pseudo-random bits is presented. Expand

Factoring integers with elliptic curves

- Computer Science, Mathematics
- 1986

This paper is devoted to the description and analysis of a new algorithm to factor positive integers that depends on the use of elliptic curves and it is conjectured that the algorithm determines a non-trivial divisor of a composite number n in expected time at most K( p)(log n)2. Expand

Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p

- Mathematics
- 1985

In this paper we present a deterministic algorithm to compute the number of F^-points of an elliptic curve that is defined over a finite field Fv and which is given by a Weierstrass equation. The… Expand

On taking roots in finite fields

- Mathematics, Computer Science
- 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
- 1977

The main result is shown that finding the least x such that x2 = a MOD(m) is NP-complete (even if m is factored). Expand

Riemann's hypothesis and tests for primality

- Mathematics
- 1976

In this paper we present two algorithms for testing primality of an integer. The first algorithm runs in 0(n1/7) steps; while, the second runs in 0(log4n) step but assumes the Extended Riemann… Expand