Abstract
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.
Cite
CITATION STYLE
Okamoto, E., & Nakamura, K. (1986). Lifetimes of Keys in Cryptographic Key Management Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 218 LNCS, pp. 246–259). Springer Verlag. https://doi.org/10.1007/3-540-39799-X_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
