TemporalKeyIntegrityProtocol(TKIP).pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
TemporalKeyIntegrityProtocol(TKIP).ppt

Temporal Key Integrity Protocol (TKIP) Presented By: Laxmi Nissanka Rao Kim Sang Soo Agenda Disadvantages of WEP Design Constraints Components of TKIP Putting the pieces together Questions Disadvantages of WEP WEP provides no forgery protection No protection against Message Replays WEP misuses the RC4 encryption algorithm in a way that exposes the protocol to weak key attacks By reusing initialization vectors, WEP enables an attacker to decrypt the encrypted data without ever learning the encryption key Design Constraints WEP-patches, on the already deployed hardware, have to depend entirely on software upgrades. The paucity of the CPU cycles. The hardwiring of the encryption algorithm. TKIP Temporal Key Integrity Protocol (TKIP) is the TaskGroupi’s solution for the security loop holes present in the already deployed 802.11 hardware It is a set of algorithms that wrap WEP to give the best possible solution given all the above mentioned design constraints. Components of TKIP A cryptographic message integrity code, or MIC, called Michael: to defeat forgeries; A new IV sequencing discipline: to remove replay attacks from the attacker’s arsenal; A per-packet key mixing function: to de-correlate the public IVs from weak keys A re-keying mechanism: to provide fresh encryption and integrity keys, undoing the threat of attacks stemming from key reuse. Defeating Forgeries: Michael Every MIC has three components: a secret authentication key K (shared only between the sender and receiver), a tagging function, and a verification predicate. Designed by Niels Ferguson. Michael (contd.) 64-bit Michael key: represented as two 32-bit words (K0,K1). The tagging function first pads a message with the hex value 0x5a and enough zero pad to bring the total message length to a multiple of 32-bits, then partitions the result into a sequence of 32-bit words M1 M2 … Mn. (L,R) ← (K0,K1) do i from 1 to n L ← L ^ Mi (L,R) ← b (L,R) return (L,R) as the tag Where b i

文档评论(0)

suijiazhuang1 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档