Cryptography,AttacksandCountermeasuresLecture4–Boo：密码学，攻击和对策讲座4–嘘.ppt

Cryptography, Attacks and Countermeasures Lecture 4 –Boolean Functions John A Clark and Susan StepneyDept. of Computer Science University of York, UK{jac,susan}@cs.york.ac.uk Stream Cipher Components Boolean Functions Typical Security Related Criteria Non-linearity. Correlation immunity Algebraic degree. Tradeoffs Will give a linear algebra treatment. Pythagoras’s theorem! Boolean Functions A Boolean function f:{0,1}n-{0,1} Boolean Functions – Algebraic normal Form (ANF) A Boolean function on n-inputs can be represented in minimal sum (XOR +) of products (AND .) form: This is the algebraic normal form of the function. The algebraic degree of the function is the size of the largest subset of inputs (i.e. the number of xj in it) associated with a non-zero co-efficient. 1 is a constant function (as is 0) x1+x3+x5 is a linear function x1.x3+x5 is a quadratic function x1.x3.x5+x4x5+x2 is a cubic function Generating ANF Given f(x1,…,xn) it is fairly straightforward to derive the ANF. Consider the general form: The constant term a0 is easily derived. a0=f(0,0,…,0) We can now determine ak by considering: f(1,….,0,0,0)=a0+a1x1= a0+a1 and so a1=a0+f(1,….,0,0,0) f(0,1,0….,0,0)=a0+a2x2= a0+a2 and so a2=a0+ f(0,1,0….,0,0)……. f(0,0,0….,0,1)=a0+anxn= a0+an and so an=a0+f(0,0,0,….0,1) We can now determine aj,k by considering: f(1,1,0…,0)=a0+a1x1+a2x2 + a1,2x1,2 = a0+a1 +a2 +a1,2 and so a1,2 = a0+a1 +a2 + f(1,1,0…,0) and so on. Vectors and their Representations Boolean functions can be regarded as vectors in R2n. Boolean functions are vectors with elements 1 or –1. Any vector space has a basis set of vectors. Given any vector v it can always be expressed UNIQUELY as a weighted sum of the vectors in the basis set. This in 3-D we have the following standard basis Others are possible: Orthonormal Basis If the basis vectors are orthogonal and each have norm (length) 1 we say that they form an orthonormal basis. We can express any vector in terms of its projec