Abstract
This paper reviews some possible design criteria for the key schedule in a DES style cryptosystem. The key schedule involves a Key Rotation component, and the permutation PC2. Together these provide for a diffusion of dependency of ciphertext bits on key bits. Some empirical rules which seem to account for the derivation of the key schedule used in the DES are first presented. A number of trials were run with various key schedules, and some further design rules were derived. An alternative form of key schedule was then tested. This used either a null PC2, or one in which permutations only occurred within the inputs to a given S-box, and a much larger rotation schedule than used in the DES. This was found to be as effective as the key schedule used in the current DES, and is proposed for use in new cryptosystems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
ASA, "Electronics Funds Transfer — Requirements for Interfaces, Part 5, Data Encryption Algorithm," AS2805.5-1985, Standards Association of Australia, Sydney, Australia, 1985.
L. Brown, "A Proposed Design for an Extended DES" in Proc. Fifth International Conference and Exhibition on Computer Security, IFIP, Gold Coast, Queensland, Australia, 19–21 May, 1988.
L. Brown and J. Seberry, "On the Design of Permutation P in DES Type Cryptosystems," in Abstracts of Eurocrypt 89, IACR, Houthalen, Belgium, 10–13 Apr., 1989.
M. Davio, Y. Desmedt, M. Fosseprez, R. Govaerts, J. Hulsbosch, P. Neutjens, P. Piret, J. Quisquater, J. Vanderwalle and P. Wouters, "Analytical Characteristics of the DES," in Advances in Cryptology — Proc. of Crypto 83, D. Chaum, R. L. Rivest and A. T. Sherman (editors), pp. 171–202, Plenum Press, New York, Aug. 22–24, 1983.
E. K. Grossman and B. Tuckerman, "Analysis of a Weakened Feistel-Like Cipher," in Proc. 1978 IEEE Conf. On Communications, pp. 46.3.1-5, IEEE, 1978.
C. H. Meyer and S. M. Matyas, Cryptography: A New Dimension in Data Security, John Wiley & Sons, New York, 1982.
J. H. Moore and G. J. Simmons, "Cycle Structure of the Weak and Semi-Weak DEs Keys," in Eurocrypt 86 — Abstracts of Papers, p. 2.1, Linkoping, Sweden, 20–22 May 1986.
J. H. Moore and G. J. Simmons, Advances in Cryptology: Proc. of CRYPTO'86, Lecture Notes in Computer Science, no. 263, pp. 9–32, Springer Verlag, Berlin, 1987.
NBS, "Data Encryption Standard (DES)," FIPS PUB 46, US National Bureau of Standards, Washington, DC, Jan. 1977.
J. Pieprzyk and J. Seberry, "Remarks on Extension of DES — Which Way to Go?," Tech. Rep. CS89/4, Dept. of Computer Science, UC UNSW, Australian Defence Force Academy, Canberra, Australia, Feb. 1989.
J. Pieprzyk, "Non-Linearity of Exponent Permutations," in Abstracts of Eurocrypt 89, IACR, Houthalen, Belgium, 10–13 Apr., 1989.
J. Seberry and J. Pieprzyk, Cryptography: An Introduction to Computer Security, Prentice Hall, Englewood Cliffs, NJ, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brown, L., Seberry, J. (1990). Key scheduling in des type cryptosystems. 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/BFb0030363
Download citation
DOI: https://doi.org/10.1007/BFb0030363
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