Skip to main content

A successful attack against the DES

  • Coding and Cryptography
  • Conference paper
  • First Online:
Information Theory and Applications (ITA 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 793))

Included in the following conference series:

  • 173 Accesses

Abstract

It is shown that the Data Encryption Standard (DES) function is divided into 68 subfunctions, and therefore the exhaustive key search attack could be done by a pipelining method. A chip is designed whose purpose is to attack the DES and a searching machine is detailed based on it. It is shown that the DES could be broken, easily and cheaply, by this machine.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Reference

  1. National Bureau of standards, ”Encryption algorithm for computer data protection: Requests for comments,” Federal Register, Vol. 40. No. 12134, 1975.

    Google Scholar 

  2. Diffie, W. and Hellman, M. E., ”Exhaustive cryptanalysis of the NBS Data Encryption Standard,” computer magazine, 10, 6, 74–84, 1977.

    Google Scholar 

  3. Punckuell, D. A. and Eshraghian, K., Basic VLSI Design (principles and applications), Prentice-Hall of Australia, 1985.

    Google Scholar 

  4. Hendessi, F., Cryptanalysis of the Data Encryption Standard, Master Thesis, Department of Electrical Engineering, Isfahan Univ. of Tech., Isfahan, Iran, 1989.

    Google Scholar 

  5. National Bureau of standards, ”Specification for the Data Encryption Standard,” Federal Register, Vol. 46, January 1977.

    Google Scholar 

  6. Meyer, C. H. and Matyas, S. M., Cryptography: A new Dimension Computer Data Security, John Wiley, New York, 1982.

    Google Scholar 

  7. Konheim, A. G., Cryptography: A Primer, John Wiley, New York, 1981.

    Google Scholar 

  8. Brickell, E. F., Moore, J. H., and Purtil, M. R., ”Structure in the S-boxes of the DES (Extended abstract),” Advanced in cryptology, Proc. of Crypto.'86, LNCS, Vol. 263, springer-verlag, 1987, pp. 3–8.

    Google Scholar 

  9. Schaumller-Binchl, “Cryptanalysis of the Data Encryption Standard, Method of Formal Coding,” Proc. of Crypto.'82, LNCS, Vol. 149, springer-verlag, 1983, pp. 235–259.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

T. Aaron Gulliver Norman P. Secord

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hendessi, F., Aref, M.R. (1994). A successful attack against the DES. In: Gulliver, T.A., Secord, N.P. (eds) Information Theory and Applications. ITA 1993. Lecture Notes in Computer Science, vol 793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57936-2_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-57936-2_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57936-6

  • Online ISBN: 978-3-540-48392-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics