4. Concluding Remarks
The keys lifetimes necessary to attain a certain low disclosure rate have been investigated for two types of schemes. DES is employed as an encryption algorithm example. This paper employs the poorest attack, namely the exhaustive attack as a cryptanalysis. There may be a more effective attack. As results, we recommend to adopt SCHEME 2 and to change the master key ‘at least’ within a few years.
Chapter PDF
References
Lennon, R.E., “Cryptography Architecture for Information Security”, IBM System J., vol.17, no.2, pp.138–150, 1978
Federal Information Processing Standards Publication No.46, National Burean of Standards, 1977.
Okamoto, E. and Nakamura, K., “Key change Periods in Cryptographic Key Management Systems”, The proceedings of the 7-th Symposium on Information Theory and Its Applications (in Japanese), pp.169–173, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okamoto, E., Nakamura, K. (1986). Lifetimes of Keys in Cryptographic Key Management Systems. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_19
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive