浅谈中途相遇攻击--meet-in-the-middle attack - philippica - 博客园



浅谈中途相遇攻击--meet-in-the-middle attack - philippica - 博客园

貌似挖的坑也够多了。。。。好多都没填,这篇最后会不会TJ还得看心情TUT

看过大白书的人应该都会发现一种神奇的算法:中途相遇法。(在第58页)这种算法将以空间换时间的思路运用到了极致,但事实上它在密码学中的作用更大

DES在过去的很长时间里都是作为标准出现的,人们花了很多力气都没有发现它有什么唯密文攻击的方法(当然,当密钥恰巧为很少的几个弱密钥时是可行的TUT 不过我们不考虑这种情况),只有暴力破解这一条道。你如果去自习查看下它S-box的构造,肯定为赞赞叹它算法的精妙

DES一共有64bit密钥,其中56bit是需要我们手动设置的,剩下8位为奇偶校验位。因此暴力破解的话最坏情况下需要2^56次方!!但在各种大触计算机层出不穷的今天,在十几个小时内破解DES也成为了可行,这才有了AES招标的这一出

但在那之前就有人提出了DES的改进,即三重DES。那问题就来了,二重DES你需要设置的密钥为112bit(56*2),那二重DES是否可行?

你也许会想,这时破解需要计算的的次数为2^112,这和2^56次方比几乎是天文数字,又何必三重DES呢?但事实上,只要制造出的计算机内存够大,我们就能以空间换时间,仅计算2^57就能破解二重DES。其中用到的就是中途相遇攻击。

在我看来,中途相遇攻击其实和hash攻击中的生日攻击很类似。


Read full article from 浅谈中途相遇攻击--meet-in-the-middle attack - philippica - 博客园


No comments:

Post a Comment

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts