t**o
发帖数: 31 | 1 星期一要交的(Network Security)作业.谢谢帮忙!
Suppose that someone suggests the following way to confirm that the two of
you are both in possession of the same secret key. You create a random bit
string the length of the key, XOR it with the key, and send the result over
the channel. Your partner XORs the incoming block with they key (which
should be the same as your key) and sends it back. You check and what you
receive is your original random string, you have verified that your partner
has the same secret | k**q
发帖数: 135 | 2 一个监听网络报文得人是可以得到明文和密文得,这个之间就是一个简单得xor算法
很容易算出xor得key吧
over
partner
Is
about
【在 t**o 的大作中提到】
: 星期一要交的(Network Security)作业.谢谢帮忙!
: Suppose that someone suggests the following way to confirm that the two of
: you are both in possession of the same secret key. You create a random bit
: string the length of the key, XOR it with the key, and send the result over
: the channel. Your partner XORs the incoming block with they key (which
: should be the same as your key) and sends it back. You check and what you
: receive is your original random string, you have verified that your partner
: has the same secret
| t**o
发帖数: 31 | 3 能不能详细点说说怎么解.
我知道用plaintext 11001100
+key stream 01101100
=cipertext 10100000
但是具体应用不会.请讲一下吧.谢谢!
【在 k**q 的大作中提到】
: 一个监听网络报文得人是可以得到明文和密文得,这个之间就是一个简单得xor算法
: 很容易算出xor得key吧
:
: over
: partner
: Is
: about
| t**o
发帖数: 31 | |
|
