Pseudorandom Generators for Group Products

We prove that the pseudorandom generator introduced in [INW94] fools group products of a given finite group. The seed length is O(log n log 1 ), where n the length of the word and is the precision. The result is equivalent to the statement that the pseudorandom generator fools read-once permutation branching programs of constant width.

• Type: Journal
• Year: 2010
• Where: ECCC
• Authors: Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák
• Keywords: ECCC 2010, Fools Group Products, Permutation Branching Programs, Pseudorandom Generator