Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > COMPUTATIONAL DISTINGUISHABILITY:
Reports tagged with Computational Distinguishability:
TR00-014 | 16th February 2000
Matthias Krause, Stefan Lucks

#### On Learning versus Distinguishing and the Minimal Hardware Complexity of Pseudorandom Function Generators

\begin{abstract}
A set $F$ of $n$-ary Boolean functions is called a pseudorandom function generator
(PRFG) if communicating
with a randomly chosen secret function from $F$ cannot be
efficiently distinguished from communicating with a truly random function.
We ask for the minimal hardware complexity of a PRFG. This question ... more >>>

ISSN 1433-8092 | Imprint