Redian新闻
>
紧急求助!星期一要交的(Network Security)作业.谢谢帮忙!
avatar
紧急求助!星期一要交的(Network Security)作业.谢谢帮忙!# EmergingNetworking - 热门网络技术
t*o
1
问了很多人都不会做,这里牛人多,帮我看看吧?谢谢了.
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 key, y
avatar
o*v
2
XOR is just tooooo weak.
3DES/AES

over
partner
Is
about

【在 t**o 的大作中提到】
: 问了很多人都不会做,这里牛人多,帮我看看吧?谢谢了.
: 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 key, y

avatar
t*o
3
版主大大,我这个学期才副修了网络课的,一点背景知识都没有.你能不能给我解释一下
这题怎么做啊?谢谢!

【在 o**v 的大作中提到】
: XOR is just tooooo weak.
: 3DES/AES
:
: over
: partner
: Is
: about

avatar
c*a
4
wrong board? should be asking math?
a xor k = c
c xor k = a
k = a xor c?

【在 t**o 的大作中提到】
: 版主大大,我这个学期才副修了网络课的,一点背景知识都没有.你能不能给我解释一下
: 这题怎么做啊?谢谢!

avatar
t*o
5
能不能详细点说说怎么解.
我知道用plaintext 11001100
+key stream 01101100
=cipertext 10100000
但是具体应用不会.请讲一下吧.谢谢!

【在 c*a 的大作中提到】
: wrong board? should be asking math?
: a xor k = c
: c xor k = a
: k = a xor c?

avatar
k*q
6
知道是xor,知道plaintext和cipertext难道还算不出来
key?

【在 t**o 的大作中提到】
: 能不能详细点说说怎么解.
: 我知道用plaintext 11001100
: +key stream 01101100
: =cipertext 10100000
: 但是具体应用不会.请讲一下吧.谢谢!

avatar
L*t
7
You send a plaintext of your choice to receiver, who will send back you the
ciphertext. Then you got the key by plaintext XOR ciphertext.
Proof:
P xor K = C
P xor P xor K = K
==> K = P xor C
The weakness in the scheme is the encryption algorithm is reversible. And
the receiver cannot verify the authenticity of a sender.

【在 t**o 的大作中提到】
: 能不能详细点说说怎么解.
: 我知道用plaintext 11001100
: +key stream 01101100
: =cipertext 10100000
: 但是具体应用不会.请讲一下吧.谢谢!

avatar
t*o
8
谢谢高手的解释,尤其是kkqq和lieheart的详细解释,我现在完全理解了.万分感谢!

over
partner
Is
about

【在 t**o 的大作中提到】
: 问了很多人都不会做,这里牛人多,帮我看看吧?谢谢了.
: 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 key, y

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。