![]() By using this partial key we can retrieve a larger part of the plaintext and then a larger part of the key and so forth and so on, till we have accomplished to retrieve the whole key and -as a consequence- the whole plaintext. ![]() In practice, the above equations mean that if we know a part of the initial plaintext, then we can retrieve part of the key relatively easily. This fact makes this encryption scheme extremely weak. If the key is smaller than the plaintext, the key is repeated. Let's say we XOR-encrypt a text file using this "secure" password/key: should not forget that:
0 Comments
Leave a Reply. |