Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ECCC
2010

favoriteEmaildiscussreport

111views more ECCC 2010»

Pseudorandom Generators for Group Products

13 years 4 months ago

Pseudorandom Generators for Group Products

Download www.math.cas.cz

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.

Michal Koucký, Prajakta Nimbhorkar, Pavel P

Real-time Traffic

ECCC 2010 | Fools Group Products | Permutation Branching Programs | Pseudorandom Generator |

claim paper

Related Content

» SmallBias Spaces for Group Products

» Pseudorandomness from Braid Groups

» A Pseudorandom Bit Generator Based on Block Upper Triangular Matrices

» Combinatorial method in the coset enumeration of symmetrically generated groups

» Inferring sequences produced by a linear congruential generator on elliptic curves missing...

» Wreath Products in Stream Cipher Design

» Design of Compact Universal DNA Microarrays for Protein Binding Microarray Experiments

» StarFree Geodesic Languages for Groups

» The RSA Group is PseudoFree

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ECCC
Authors	Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák

Comments (0)