Cryptography Reference
In-Depth Information
43-byte colliding key pairs:
K
1
=
00 6d 41 8b 95 46 07 a4 87 8d 69 d7 bc bc c4 70
4a 3b ed 94 34 50 04 68 4d 4f 2e 30 c1 6e 20 a8
bf 80 b6 ae df ae 43 56 0a 80 e7
K
2
=
00 6d 41 8b 95 46 07 a4 87 8d 69 d7 bc bc c4 70
4a 3b ed 94 34 50 04 68 4d 4f 2e 30 c1 6e 20 a8
bf 80 b6 ae df ae 43 56 0a 80 e8
24-byte colliding key pairs:
K
1
=
00 42 CE D3 DF DD B6 9D 41 3D BD 3A B1 16 5A 33
ED A2 CD 1F E2 8C 01 76
K
2
=
00 42 CE D3 DF DD B6 9D 41 3D BD 3A B1 16 5A 33
ED A2 CD 1F E2 8C 01 77
Note that in each of the colliding key pairs, one key differs from the other in
a single byte position only. The next example shows a 20-byte near-colliding
key pair, i.e., a key pair whose corresponding states after the KSA differ in
exactly two positions.
20-byte near-colliding key pairs:
K
1
=
00 73 2F 6A 01 37 89 C5 15 49 9A 55 98 54 D7 53 4E F6 4F DC
K
2
=
00 73 2F 6A 01 37 89 C5 15 49 9A 55 98 54 D7 53 4E F6 4F DD.
Apart from maxc, the depth of recursion is also a parameter of Algo-
rithm 3.4.1. The experiments described in [111] have considered a maxc value
around 10 and the maximum depth of recursion less than 20. Since it is a
heuristic search, further improvement is possible and is an open research topic.
RESEARCH PROBLEMS
Problem 3.1 The proportion of anomaly pairs tends to decrease with in-
creasing key length. Theoretical investigation into the nature of anomaly
pairs and their relation with the key length is an open problem.
