Skip to main content

Comparison of block ciphers

  • Section 6 Block Ciphers
  • Conference paper
  • First Online:
Advances in Cryptology — AUSCRYPT '90 (AUSCRYPT 1990)

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

Included in the following conference series:

Abstract

Several DES replacement block ciphers have been published. In this paper a report will be given on the development of a package for analysis and comparison of block ciphers. Experimental results are presented on applying this package to DES, FEAL-N, and Madryga ciphers.

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.

References

  1. A. Shimizu and S. Miyaguchi, ‘Fast Data Encipherment Algorithm FEAL', Advances in Cryptology: Proc. Eurocrypt '87, 1988, pp. 267–278.

    Google Scholar 

  2. S. Miyaguchi, A. Shiraishi, A. Shimizu, ‘Fast Data Encipherment Algorithm FEAL-8', Review of the Electrical Communications Laboratories, Vol. 36, No. 4, 1988, pp. 433–437.

    Google Scholar 

  3. W.E. Madryga, ‘A High Performance Encryption Algorithm', Computer Security: A Global Challenge, Elsevier Science Publishers B.V., 1984, pp. 557–570.

    Google Scholar 

  4. B. Den Boer, ‘Cryptanalysis of F.E.A.L.', Advances in Cryptology: Proc. Eurocrypt '88, pp. 293–299.

    Google Scholar 

  5. H. Becker and F. Piper, ‘Cipher Systems: The Protection of Communications', John Wiley and Sons, 1982.

    Google Scholar 

  6. A. Lempel and J. Ziv, ‘On the Complexity of Finite Sequences', IEEE Trans. on Information Theory Vol. IT-22, Jan. 1976, pp. 75–81.

    Google Scholar 

  7. A.K. Leung and S.E. Tavares, 'sequence Complexity as a Test for Cryptographic Systems', Advances in Cryptology '84, pp. 468–474.

    Google Scholar 

  8. J.M. Carroll and L.E. Robbins, ‘Using Binary Derivatives to Test an Enhancement of DES', Cryptologia, Vol. XII Number 4, Oct. 1988, pp. 193–208.

    Google Scholar 

  9. J.M. Carroll, ‘The binary derivative test for the appearance of randomness and its use as a noise filter', Technical Report No. 221, Dept. of Computer Science, The University of Western Ontario, November 1988.

    Google Scholar 

  10. A.K. Leung and S.E. Tavares, 'sequence Complexity as a Test for Cryptographic Systems', Advances in Cryptology, Crypto '84, pp. 468–474.

    Google Scholar 

  11. A.F. Webster and S.E. Tavares, ‘On the Design of S-Boxes', Advances in Cryptology: Crypto '85, 1986, pp. 523–530.

    Google Scholar 

  12. A.G. Konheim, ‘Cryptography: A Primer', John Wiley and Sons, 1981.

    Google Scholar 

  13. J.B. Kam and G.I. Davida, "Structured Design of Substitution — Permutation Encryption Networks", IEEE Trans. on Computer, Vol. C-28, No. 10, Oct. 1979, pp. 747–753.

    Google Scholar 

  14. D.E. Knuth, "The Art of Computer Programming, Vol. 2: Seminumerical Algorithms", Addison-Wesley, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jennifer Seberry Josef Pieprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gustafson, H., Dawson, E., Caelli, B. (1990). Comparison of block ciphers. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030362

Download citation

  • DOI: https://doi.org/10.1007/BFb0030362

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53000-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics