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

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

  1. 1、本文档共38页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Cryptography,AttacksandCountermeasuresLecture4–Boo:密码学,攻击和对策讲座4–嘘.ppt

Cryptography, Attacks and Countermeasures Lecture 4 –Boolean Functions John A Clark and Susan Stepney Dept. 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

文档评论(0)

wuyouwulu + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档