Thomas Holenstein

activity

20102014

p

-adic Canonical Quadratic Form in Polynomial Time

2 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2014★ 2 cited

Computing the $p$ -adic Canonical Quadratic Form in Polynomial Time

Chandan Dubey, Thomas Holenstein

An $n$ -ary integral quadratic form is a formal expression $Q (x_{1}, .., x_{n}) = \sum_{1 \leq i, j \leq n} a_{ij} x_{i} x_{j}$ in $n$ -variables $x_{1}, ..., x_{n}$ , where $a_{ij} = a_{j i} \in Z$ . W…

cs.CR2012

Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls

Thomas Holenstein, Makrand Sinha

We show that a black-box construction of a pseudorandom generator from a one-way function needs to make Omega(n/log(n)) calls to the underlying one-way function. The bound even hol…

cs.CR2010★ 1 cited

General Hardness Amplification of Predicates and Puzzles

Thomas Holenstein, Grant Schoenebeck

We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the fir…

Computing the p-adic Canonical Quadratic Form in Polynomial Time

Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls

General Hardness Amplification of Predicates and Puzzles

Computing the $p$ -adic Canonical Quadratic Form in Polynomial Time