asymptotic enumeration of correlation immune functions
play

Asymptotic enumeration of correlation-immune functions E. Rodney - PowerPoint PPT Presentation

Asymptotic enumeration of correlation-immune functions E. Rodney Canfield Jason Gao Catherine Greenhill Brendan D. McKay Robert W. Robinson Correlation-immune functions 1 Correlation-immune functions Suppose we have a secret Boolean function


  1. Asymptotic enumeration of correlation-immune functions E. Rodney Canfield Jason Gao Catherine Greenhill Brendan D. McKay Robert W. Robinson Correlation-immune functions 1

  2. Correlation-immune functions Suppose we have a secret Boolean function of n Boolean variables. Suppose a malicious eavesdropper is able to observe function values while monitoring any k of the variables. We would like these observations to give the eavesdropper as little information as possible. Correlation-immune functions 2

  3. Correlation-immune functions Suppose we have a secret Boolean function of n Boolean variables. Suppose a malicious eavesdropper is able to observe function values while monitoring any k of the variables. We would like these observations to give the eavesdropper as little information as possible. The function is correlation-immune of order k if the function value is uncorrelated with any k of the arguments. Suppose the fraction λ of all 2 n argument values give a function value 1. Then correlation-immune means that if any arbitrary k of the arguments are fixed to arbitrary values, the same fraction λ of the remaining 2 n − k argument values give a function value 1. The weight of the function is λ 2 n — the number of argument lists that give function value 1. Correlation-immune functions 2

  4. Example (Sloane): n = 12, k = 3, λ = 24 / 2 12 , weight = 24 = 2 k 3. The rows of the table give the argument lists for which the function value is 1. 0 1 1 1 1 1 1 1 1 1 1 1 0 0 1 0 1 1 1 0 0 0 1 0 0 0 0 1 0 1 1 1 0 0 0 1 0 1 0 0 1 0 1 1 1 0 0 0 0 0 1 0 0 1 0 1 1 1 0 0 0 0 0 1 0 0 1 0 1 1 1 0 0 0 0 0 1 0 0 1 0 1 1 1 0 1 0 0 0 1 0 0 1 0 1 1 0 1 1 0 0 0 1 0 0 1 0 1 0 1 1 1 0 0 0 1 0 0 1 0 0 0 1 1 1 0 0 0 1 0 0 1 0 1 0 1 1 1 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 1 0 1 1 1 1 0 1 0 0 0 1 1 1 0 1 0 1 1 0 1 0 0 0 1 1 1 1 1 0 1 1 0 1 0 0 0 1 1 1 1 1 0 1 1 0 1 0 0 0 1 1 1 1 1 0 1 1 0 1 0 0 0 1 0 1 1 1 0 1 1 0 1 0 0 1 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 1 1 1 0 1 1 0 1 1 1 0 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 1 1 1 0 1 1 This is an orthogonal array of 2 levels, 12 variables, 24 runs and strength 3. Correlation-immune functions 3

  5. Our task Since the weight is a multiple of 2 k , let’s define it to be 2 k q , where 0 ≤ q ≤ 2 n − k . Correlation-immune functions 4

  6. Our task Since the weight is a multiple of 2 k , let’s define it to be 2 k q , where 0 ≤ q ≤ 2 n − k . Define N ( n, k, q ) to be the number of n -variable correlation-immune functions of order k and weight 2 k q . Also define N ( n, k ) = � q N ( n, k, q ). We seek the asymptotic values of N ( n, k, q ) and N ( n, k ) as n → ∞ , with k and q being some functions of n . Correlation-immune functions 4

  7. Our task Since the weight is a multiple of 2 k , let’s define it to be 2 k q , where 0 ≤ q ≤ 2 n − k . Define N ( n, k, q ) to be the number of n -variable correlation-immune functions of order k and weight 2 k q . Also define N ( n, k ) = � q N ( n, k, q ). We seek the asymptotic values of N ( n, k, q ) and N ( n, k ) as n → ∞ , with k and q being some functions of n . Define k k � n � n � � � � M = and Q = i . i i i =0 i =1 Theorem (Denisov, 1992) If k ≥ 1 is a constant integer, then as n → ∞ , N ( n, k ) ∼ 2 2 n + Q − k (2 n − 1 π ) − ( M − 1) / 2 . Correlation-immune functions 4

  8. Denisov’s method (translated) For S ⊆ { 1 , 2 , . . . , n } , let β S be the number of rows ( β 1 , β 2 , . . . , β n ) of the matrix such that β i = 1 for i ∈ S . Also β ∅ = 2 k q (i.e., all the rows). Then the matrix is that of a correlation-immune function of weight 2 k q iff β S = 2 k −| S | q for | S | ≤ k. Correlation-immune functions 5

  9. Denisov’s method (translated) For S ⊆ { 1 , 2 , . . . , n } , let β S be the number of rows ( β 1 , β 2 , . . . , β n ) of the matrix such that β i = 1 for i ∈ S . Also β ∅ = 2 k q (i.e., all the rows). Then the matrix is that of a correlation-immune function of weight 2 k q iff β S = 2 k −| S | q for | S | ≤ k. Consider � � � i ∈ S β i � � x , 1 + S β ∈{ 0 , 1 } n | S |≤ k where { x S | S ⊆ { 1 , 2 , . . . , n } } are indeterminates. Then N ( n, k, q ) is the coefficient of the monomial x 2 k −| S | q � . S | S |≤ k Denisov extracts N ( n, k ) by Fourier inversion. Correlation-immune functions 5

  10. The inversion integral is concentrated at two equivalent places, where it is approxi- mately gaussian. Expansion near the critical points together with bounds away from the critical points establishes the asymptotics. Correlation-immune functions 6

  11. The inversion integral is concentrated at two equivalent places, where it is approxi- mately gaussian. Expansion near the critical points together with bounds away from the critical points establishes the asymptotics. Denisov’s retraction In 2000, Denisov published a retraction of his 1992 result. He wrote that he had “made a mistake”, and gave a new asymptotic value of N ( n, k ). Correlation-immune functions 6

  12. The inversion integral is concentrated at two equivalent places, where it is approxi- mately gaussian. Expansion near the critical points together with bounds away from the critical points establishes the asymptotics. Denisov’s retraction In 2000, Denisov published a retraction of his 1992 result. He wrote that he had “made a mistake”, and gave a new asymptotic value of N ( n, k ). This is unfortunate, since the 1992 result is correct and the 2000 result is incorrect! Correlation-immune functions 6

  13. Alternative approach For a boolean function g ( x 1 , . . . , x n ), the Walsh transform of g is the real-valued g over { 0 , 1 } n defined by function ˆ � g ( x 1 , . . . , x n )( − 1) w 1 x 1 + ··· + w n x n . g ( w 1 , . . . , w n ) = ˆ ( x 1 ,...,x n ) ∈{ 0 , 1 } n It is known that g is correlation-immune of order k iff ˆ g ( w 1 , . . . , w n ) = 0 whenever the number of 1s in w 1 , . . . , w n is between 1 and k . Correlation-immune functions 7

  14. Alternative approach For a boolean function g ( x 1 , . . . , x n ), the Walsh transform of g is the real-valued g over { 0 , 1 } n defined by function ˆ � g ( x 1 , . . . , x n )( − 1) w 1 x 1 + ··· + w n x n . g ( w 1 , . . . , w n ) = ˆ ( x 1 ,...,x n ) ∈{ 0 , 1 } n It is known that g is correlation-immune of order k iff ˆ g ( w 1 , . . . , w n ) = 0 whenever the number of 1s in w 1 , . . . , w n is between 1 and k . Put R = λ/ (1 − λ ). Define � � x α S � � F ( x ) = 1 + R , S α ∈{± 1 } n | S |≤ k where � α S = α i . i ∈ S N ( n, k, q ) is the constant term of ( Rx ∅ ) − 2 k q F ( x ). Theorem: Correlation-immune functions 7

  15. Apply the Cauchy coefficient formula, using unit circles as contours, and change variables as x S = e iθ S for each S . Then N ( n, k, q ) = (1 + R ) 2 n (2 π ) M R 2 k q I ( n, k, q ) , where � π � π I ( n, k, q ) = − π · · · − π G ( θ ) d θ , 1 + Re if α ( θ ) G ( θ ) = e − i 2 k qθ ∅ � , 1 + R α ∈{± 1 } n � f α ( θ ) = α S θ S . | S |≤ k Here θ is a vector of the variables θ S , | S | ≤ k , in arbitrary order. Correlation-immune functions 8

  16. Analysis of the domain of integration The integrand 1 + Re if α G ( θ ) = e − i 2 k qθ ∅ � 1 + R α ∈{± 1 } n has greatest absolute value 1 when � f α = f α ( θ ) = α S θ S | S |≤ k is a multiple of 2 π for each S . When does that happen? Correlation-immune functions 9

  17. Analysis of the domain of integration The integrand 1 + Re if α G ( θ ) = e − i 2 k qθ ∅ � 1 + R α ∈{± 1 } n has greatest absolute value 1 when � f α = f α ( θ ) = α S θ S | S |≤ k is a multiple of 2 π for each S . When does that happen? Define the difference operator δ j f ( α 1 ,...,α j ,...,α n ) = f ( α 1 ,...,α j ,...,α n ) − f ( α 1 ,..., − α j ,...,α n ) . and in general δ S = � j ∈ S δ j . If each f α is a multiple of 2 π , then so are all the differences. Now we compute δ S f α = 2 | S | � α T θ T . T ⊇ S and apply this with decreasing | S | . Correlation-immune functions 9

  18. Conclusion: | G ( θ ) | = 1 iff there are integers j S such that � θ T = 2 −| S | +1 j S π T ⊇ S for every S ⊆ { 1 , 2 , . . . , n } with | S | ≤ k . There are 2 Q such critical points, where Q = � k � � n i =1 i . i Correlation-immune functions 10

  19. Conclusion: | G ( θ ) | = 1 iff there are integers j S such that � θ T = 2 −| S | +1 j S π T ⊇ S for every S ⊆ { 1 , 2 , . . . , n } with | S | ≤ k . There are 2 Q such critical points, where Q = � k � � n i =1 i . i Define the critical region R to be the set of points θ such that, for some critical point ˆ θ | θ S − ˆ θ S | ≤ ∆(2 n ) −| S | for each S , where ∆ = 2 − n/ 2+ k +3 λ − 1 / 2 n k +1 / 2 M 1 / 2 . These 2 Q cuboids are disjoint and equivalent. Correlation-immune functions 10

  20. The integrand outside the critical region If θ is not in the critical region, � − 4 | G ( θ ) | < exp � . 5 nM Correlation-immune functions 11

Recommend


More recommend