Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 206,587,597 papers from all fields of science

Search

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…

2013

2013

This chapter covers stream ciphers with security proofs with a special focus on the Blum-Blum-Shub generator the most important…

Highly Cited

2009

Highly Cited

2009

This paper attempts to give an extension of learning theory to a setting where the assumption of i.i.d. data is weakened by…

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…

Highly Cited

1998

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…

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…

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…

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…

Review

1989

Review

1989

We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal…