An improvement of Davies’ attack on DES

@article{Biham2007AnIO,
  title={An improvement of Davies’ attack on DES},
  author={E. Biham and A. Biryukov},
  journal={Journal of Cryptology},
  year={2007},
  volume={10},
  pages={195-205}
}
  • E. Biham, A. Biryukov
  • Published 2007
  • Computer Science
  • Journal of Cryptology
  • In this paper we improve Davies’ attack [2] on DES to become capable of breaking the full 16-round DES faster than the exhaustive search. Our attack requires 250 known plaintexts and 250 complexity of analysis. If independent subkeys are used, a variant of this attack can find 26 bits out of the 768 key bits using 252 known plaintexts. All the 768 bits of the subkeys can be found using 260 known plaintexts. The data analysis requires only several minutes on a SPARC workstation. Therefore, this… CONTINUE READING
    48 Citations
    Improved Davies-Murphy's Attack on DES Revisited
    • 3
    Improved Meet-in-the-Middle Attacks on Reduced-Round DES
    • 53
    • PDF
    New Lightweight DES Variants
    • 254
    • PDF
    Cryptanalysis of some block ciphers
    • PDF
    Techniques for Cryptanalysis of Block Ciphers
    • 4
    • PDF
    A True Random-Number Encryption Method
    • 3
    Statistical and Algebraic Properties of DES
    • 1
    • PDF

    References

    SHOWING 1-5 OF 5 REFERENCES
    Differential Cryptanalysis of the Data Encryption Standard
    • 922
    • PDF
    Linear Cryptanalysis Method for DES Cipher
    • 2,518
    • PDF
    Pairs and triplets of DES S-boxes
    • 71
    • PDF
    Investigation of a Potential Weakness in the DES Algorithm
    • pri- vate communications,
    • 1987
    How to Strengthen DES Against Dif- ferential Attacks
    • 1994