Redian新闻
>
Triple DES 有什么弱点?
avatar
Triple DES 有什么弱点?# Security - 系统安全
h*r
1
能不能指点些资料查查, 或者任何idea, 多谢了!
avatar
w*o
4

1. It's a make-up scheme that defends exhaustive key search.
As key scheduling in Feistel structures incurs latency, 3DES
is very slow, normally can only get 1/3 speed of DES,
and 1/10 speed of AES.
2. Block size is only 64-bit, which is vulnerable to exhaustive
plaintext search when the input plaintext has low entropy.
For instance, English text has low entropy. Instead of
searching 2^64 random cases, you only need to search 2^26 (cannot
remember exact number) cases.
Othe

【在 h**********r 的大作中提到】
: 能不能指点些资料查查, 或者任何idea, 多谢了!
avatar
w*o
5

3DES is not vulnerable to these academia attacks.
These RSA people don't know Shannon's pure cipher system,
where EDE equals to E (E: encryption, D:decryption).
So-called double encryption and double key problem are not
justifiable in theory, as Shannon's pure cipher theory implied,
but these RSA people (including Ron Rivest) don't read Shannon's
result, and invent a set of vulnerable schemes, then attack
the vulnerable schemes to attract attention.
This is really amazing.

【在 h**********r 的大作中提到】
: 恩, get two paper in the reference list.
: Thx.

avatar
h*r
6
THX a lot!

【在 w*******o 的大作中提到】
:
: 3DES is not vulnerable to these academia attacks.
: These RSA people don't know Shannon's pure cipher system,
: where EDE equals to E (E: encryption, D:decryption).
: So-called double encryption and double key problem are not
: justifiable in theory, as Shannon's pure cipher theory implied,
: but these RSA people (including Ron Rivest) don't read Shannon's
: result, and invent a set of vulnerable schemes, then attack
: the vulnerable schemes to attract attention.
: This is really amazing.

avatar
h*r
7
EDE == E? I remember I this is proven to be false in Stalling's
Cryptography and Network Security

【在 w*******o 的大作中提到】
:
: 3DES is not vulnerable to these academia attacks.
: These RSA people don't know Shannon's pure cipher system,
: where EDE equals to E (E: encryption, D:decryption).
: So-called double encryption and double key problem are not
: justifiable in theory, as Shannon's pure cipher theory implied,
: but these RSA people (including Ron Rivest) don't read Shannon's
: result, and invent a set of vulnerable schemes, then attack
: the vulnerable schemes to attract attention.
: This is really amazing.

avatar
w*o
8

no, the term "equal" here is about the sample space.
of course if "EDE=E", then why do the "DE" part?
check Shannon's pure cipher for details.

【在 h**********r 的大作中提到】
: EDE == E? I remember I this is proven to be false in Stalling's
: Cryptography and Network Security

avatar
h*r
9
Maybe I make myself misunderstood, I really mean EDE != E, but I have not
read the proof of this. Does Shannon provide any idea about this? I know
his paper is a milestone, I will go to read it for sure. :) thx.

【在 w*******o 的大作中提到】
:
: no, the term "equal" here is about the sample space.
: of course if "EDE=E", then why do the "DE" part?
: check Shannon's pure cipher for details.

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