2014年Symmetric Key Crypto.pptVIP

  • 8
  • 0
  • 约1.99万字
  • 约 50页
  • 2017-09-01 发布于江苏
  • 举报
Part 1 ? Cryptography * 3DES Why not C = E(E(P,K),K) ? Trick question --- it’s still just 56 bit key Why not C = E(E(P,K1),K2) ? A (semi-practical) known plaintext attack Pre-compute table of E(P,K1) for every possible key K1 (resulting table has 256 entries) Then for each possible K2 compute D(C,K2) until a match in table is found When match is found, have E(P,K1) = D(C,K2) Result gives us keys: C = E(E(P,K1),K2) Part 1 ? Cryptography

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档