How Easy is Collision Search. New Results and Applications to DES
How Easy is Collision Search. New Results and Applications to DES
复制标题
DOI：
10.1007/0-387-34805-0_38
复制
发表时间：
1989-07
期刊：
影响因子：
--
通讯作者：
J. Quisquater;J. Delescaille
中科院分区：
文献类型：
--
作者：
J. Quisquater;J. Delescaille
给定密码算法f(取决于固定消息和密钥k)，具有冲突k0和k1(简称冲突)的一对密钥是使得f(m，k0)=f(m，k1)的密钥。密码算法的冲突的存在意味着该算法在精确的技术意义上是不可信的(见[2])。
Given a cryptographic algorithmf(depending upon a fixed messagemand a keyk), a pair of keys with collisionk0andk1(in short, acollision) are keys such thatf(m,k0) =f(m,k1).The existence of collisions for a cryptographic algorithm means that this algorithm is notfaithfulin a precise technical sense (see [2]).