Skip to main content

The data base of selected permutations

Extented abstract

  • Conference paper
  • First Online:
Advances in Cryptology — ASIACRYPT '91 (ASIACRYPT 1991)

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

Included in the following conference series:

Abstract

The so called selected permutations, which can be used to compose S-boxes in the DES-like ciphers, are classified under the action of a transformation group G *. A method for building up a data base of the selected permutations is given. In fact, we have built up a data base which consists of one representative from each of the G *-equivaIent classes, it turns out that the data base is of size 17433 and can be easily memorized by the help of a small magnetic disc. The constructed data base together with the applications of the group G * will produce totally 17433×3×29 selected permutations, which can be used to provide ready raw material for composing S-boxes.

This presentation was prepared during a visit to the Department of Mathematics, Royal Holloway and Bedford New College, University of London, and supported by SERC grant GR/F 72727.

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. C. Adams and S. Tavares, “The Structured Design of Cryptographically Good S-Boxes”, J. Cryptology, Vol.3, No. 1,1990.

    Google Scholar 

  2. D. K. Bransted, J. Gait and S. Katzke, “Report of the Workshop on Cryptography in Support of Computer Security”, NBS, Sept. 1977.

    Google Scholar 

  3. E. F. Brickell, J. H. Moore and M. It. Purtill, “Structure in the S-boxe of the DES”, in Advances in Cryptology: Proc. of CRYPTO'86.

    Google Scholar 

  4. R. Forre, “The strict avalanche criterion:spectral properties of boolean functions and an extended definition”, in Advances in Cryptology: Proc. of CRYPTO'88.

    Google Scholar 

  5. A. F. Webster and S. E. Tavares, “On the design of S-boxes”, in Advances in Cryptology: Proc. of CRYPTO'85.

    Google Scholar 

  6. J. H. Yang, Z. D. Dai and K. C. Zeng, “A Cryptographic Study on S-boxes of DES Type (I). An integrated analysis of the Design Criteria for S-boxes”, To appear at “System Science and Mathematics”, 1991.

    Google Scholar 

  7. K. C. Zeng, Z. D. Dai and J. H. Yang, “A Cryptographic Study on S-boxes of DES Type (II). An Entropy Leakage Analysis for the Key”, To appear at “System Science and Mathematics”, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, JH., Dai, ZD., Zeng, KC. (1993). The data base of selected permutations. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics