Abstract
The technique of using encryption for protecting information in a network environment involves managing encryption keys within that same network. In large distributed networks the goal of achieving a secure environment requires a secure method of performing network key management. Network security, system security, and application security by means of data encryption rely on encryption keys remaining secret.
Both international and domestic standards organizations such as the International Organization for Standardization (ISO), the American National Standards Institute (ANSI), and the National Institute of Standards and Technology (NIST) address the issues of encryption through various standards. However, these standards discuss methods of encryption in a general manner, independent of network or application architecture. Given the variety of users, the plethora of networks, and the complexity of the subject matter, this is a rational approach.
Acceptable and proven methods of performing key management in a large distributed environment are presented here. The basic DOs and DON'Ts of key management including the allimportant WHYs are discussed at length. In particular, PINs and their use in financial transactions are described, the importance of sound password management is explored, and the issues of software integrity are explained in detail. Recommendations for proper treatment and implementation are given for each of these topics.
Recommended Citation
Stapleton, J. J. and St. Clair, D. C., "Network Key Management in a Large Distributed Environment" (1992). Computer Science Technical Reports. 139.
https://scholarsmine.mst.edu/comsci_techreports/139
Department(s)
Computer Science
Second Department
Mathematics and Statistics
Report Number
CSc-92-10
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1992 University of Missouri - Rolla, All rights reserved
Publication Date
1 May, 1992
Comments
The first Author is a Graduate Student,
This work was supported in part by the National Science Foundation under Grant Numbers MIP-8909749 and CDA-8820714, and in part by the AMOCO Faculty Development Program.This report is substantially the M.S. thesis of the first author, completed May, 1992.
This thesis has been prepared in the format used by the Association for Computing Machinery (ACM). Pages 1-114 will be presented for publication in the Communications of the ACM.