#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2003

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Journals and Conferences

#### Key Phrases

Learn More

- Gustav Hast
- APPROX-RANDOM
- 2005

- Gustav Hast
- 2005

An instance of a Boolean constraint satisfaction problem, CSP, consists of a set of constraints acting over a set of Boolean variables. The objective is to find an assignment to the variables that satisfies all the constraints. In the maximization version, Max CSP, each constraint has a weight and the objective is to find an assignment such that the weight… (More)

- Gustav Hast
- Journal of Cryptology
- 2003

We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing improved security for the Goldreich–Levin hard-core bit against nearly one-sided tests. The analysis is extended to prove the security of the Blum–Micali pseudo-random generator combined with… (More)

- Gustav Hast
- APPROX-RANDOM
- 2004

- Gustav Hast
- ICALP
- 2005

- ‹
- 1
- ›