Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

Context. The cryptographically secure pseudo-random number generator Blum Blum Shub (BBS) is a simple algorithm with a strong… Expand

Highly Cited

2005

Highly Cited

2005

The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and… Expand

Highly Cited

2001

Highly Cited

2001

We discuss the parametrized complexity of counting and evaluation problems on graphs where the range of counting is denable in… Expand

2000

2000

VLSI modules are proposed for fast, efficient generation of high-throughput Blum-Blum-Shub (BBS) and BBS-like sequences using… Expand

Highly Cited

1999

Highly Cited

1999

In this paper we introduce and compare computability concepts on the set of closed subsets of Euclidean space. We use the… Expand

Highly Cited

1998

Highly Cited

1998

Abstract We present a watermarking procedure to embed copyright protection into digital audio by directly modifying the audio… Expand

1997

1997

We propose a weak version of the Blum?Shub?Smale model of computation over the real numbers. In this weak model only a “moderate… Expand

Highly Cited

1996

Highly Cited

1996

We estimate the probability that a given number of projective Newton steps applied to a linear homotopy of a system of n… Expand

Highly Cited

1994

Highly Cited

1994

We investigate the energy of arrangements of N points on the surface of a sphere in R3, interacting through a power law potential… Expand

Highly Cited

1993

Highly Cited

1993

We propose a weak version of the Blum-Shub-Smale model (1989) of computation over the real numbers. In this weak model only a… Expand