1 / 3

Entropy Equalization task for Next-Block Pseudoentropy PRGs

Hybrid construction with seed length optimization for generating next-bit predictors with pseudoentropy and high distinguishability. Task involves transforming input X to X' maintaining conditional entropy.

leal
Download Presentation

Entropy Equalization task for Next-Block Pseudoentropy PRGs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Next-Block Pseudoentropy ! PRG g(x1,h1)= g(x2,h2)= … f(x2) f(xt) f(x1) h h h h(x2) h(xt) h(x1) g(xt,ht)= … extractors G(x1,h1…,xt,ht) n+|h|+ 1 bits of next-block pseudoentropy

  2. Next-Block Pseudoentropy ! PRG • Distinguisher for G ) next-bit predictor for G )(hybrid) next-bit predictor for g )gdoes not have high next-bit pseudoentropy • Seed length O(n3), but construction is (highly) non-uniform • “Entropy equalization” )uniform construction with seed length O(n4)

  3. Entropy Equalization Task: Given X=(X1…Xn) with next-block-entropy k, construct X’ =(X’1…X’n’) for which  Y’=(Y’1…Y’n’) with • 8i (X’1…X’i-1,X’i)≈C (X’1…X’i-1,Y’i) • 8i H(Y’i|X’1…X’i-1) = k/n - ± X’ = (X(1)I,X(1)I+1…X(1)n,X(2)1, …X(t)I-n)andY’ = (Y(1)I,Y(1)j+1…Y(1)n,Y(2)1, …Y(t)I-n) 8i H(Y’i|X’1…X’i-1) = k/n - k/(t-1)n … … X(1)1 X(1)1 X(t)1 X(1)2 X(t)n X(2)2 … … X(1)n X(2)n X(t)n n-j j

More Related