Davies attack
In
brute force
. There are tradeoffs between the number of required plaintexts, the number of key bits found, and the probability of success; the attack can find 24 bits of the key with 252 known plaintexts and 53% success rate.
The Davies attack can be adapted to other Feistel ciphers besides DES. In 1998, Pornin developed techniques for analyzing and maximizing a cipher's resistance to this kind of cryptanalysis.
References
- Donald Davies, ISSN 0933-2790. Retrieved 28 September 2018.
- Eli Biham, Alex Biryukov (May 1994). An Improvement of Davies' Attack on DES (Springer-Verlag. pp. 461–467. Retrieved 24 January 2007.
- Thomas Pornin (October 1998). Optimal Resistance Against the Davies and Murphy Attack (PDF). Advances in Cryptology – ASIACRYPT '98. Beijing: Springer-Verlag. pp. 148–159. Retrieved 28 September 2018.