This commit is contained in:
parent
0f6bea0a04
commit
ec741eb394
@ -63,7 +63,7 @@
|
||||
|
||||
Would generate a tree that looks like:
|
||||
|
||||
() ->{a->{a, b}, b->{a}}
|
||||
$$() ->{a->{a, b}, b->{a}}$$
|
||||
|
||||
Since the words were encrypted with the same key, that means if we were to generate a possible key, that key would need to decrypt both ciphertexts such that when the tree is navigated we navigate to nodes that exist. If the key results in a path in the tree that does not exist, then we can disregard that answer as a possible key and continue with the possible next key.
|
||||
Once you find a key that is the same length as the cipher text, we know that we found the right key.
|
||||
|
Reference in New Issue
Block a user