Abstract
This paper presents a layered approach to the design of private key cryptographic algorithms based on a few strategically chosen layers. Each layer is a conceptually simple invertible transformation that may be weak in isolation, but makes a necessary contribution to the security of the algorithm. This is in contrast to algorithms such as DES which utilize many layers and depend on S-boxes that have no simple mathematical interpretation. A property called transparency is introduced to deal with the interaction of layers and how they must be selected to eliminate system weaknesses.
Utilizing this layered approach, a private key cryptographic algorithm consisting of three layers is constructed to demonstrate the design criteria. The algorithm has an adequate key space and valid keys can be easily generated. The design is based on a symmetrical layered configuration, which allows encryption and decryption to be performed using the same algorithm. The algorithm is suitable for VLSI implementation. Some statistical tests are applied to the algorithm in order that its cryptographic performance can be evaluated. The test results and attempts at cryptanalysis suggest that the three-layered algorithm is secure.
Chapter PDF
8. References
Akl, S.G. and Meijer, H., “Two New Secret Key Encryption Algorithms”, presented at Eurocrypt’ 85, Linz, Austria, Apr. 1985.
Blakley, G.R. and Borosh, I., “Rivest-Shamir-Adleman Public Key Cryptosystems Do Not Always Conceal Messages”, Comp. & Maths with Appls., Vol. 5, pp. 168–178, Pergamon Press Ltd., 1979.
“Data Encryption Standard”, FIPS PUB 46, National Bureau of Standards, Washington, D.C., Jan. 1977.
Davies, D.W., “Some Regular Properties of the DES”, Advances in Cryptology: Proceedings of Crypto’ 82, pp. 89–96, Plenum Press, 1983.
Denning, D.E., Cryptography and Data Security, Addison-Wesley, Reading, Mass., 1982.
Feistel, H., “Cryptography and Computer Privacy”, Sci. Am., Vol. 228, pp. 15–23, May 1973.
Hellman, M.E., et al., “Results of an Initial Attempt to Cryptanalyze the NBS Data Encryption Standard”, Information Systems Lab., Dept. of Electrical Eng., Stanford Univ., 1976.
Kabiski, B.S., Rivest, R.L. and Sherman, A.T., “Is the Data Encryption Standard a Group?”, presented at Eurocrypt’ 85, Linz, Austria, Apr. 1985.
Knuth, D., The Art of Computer Programming; Vol. 2, Seminumerical Algorithms, Addison-Wesley, Reading, Mass., 1969.
Konheim, A.G., Cryptography: A Primer, John Wiley and Sons, New York, 1981.
Lempel, A. and Ziv, J., “On the Complexity of Finite Sequences”, IEEE Trans. on Info. Theory, Vol. 10–22, pp. 75–81, Jan. 1976.
Leung, A.K. and Tavares, S.E., “Sequence Complexity as a Test for Cryptographic Systems”, Proceedings of Crypto’ 84, pp. 468–474, Springer-Verlag, 1985.
Rivest, R.L., Shamin, A. and Adleman, L., “A Method for Obtaining Digital Signatures and Fublic-Key Cryptosystems”, Comm. ACM, Vol. 21, pp. 120–126, Feb. 1978.
Shannon, C.E., “Communication Theory of Secrecy Systems”, Bell Syst. Tech. J., Vol. 28, pp. 656–715, Oct. 1949.
Spencer, M.E. and Tavares, S.E., “Layered Broadcast Cryptographic Systems”, Advances in Cryptology: Proceedings of Crypto’ 83, pp. 157–170, Plenum Press, 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
Moore, T.E., Tavares, S.E. (1986). A Layered Approach to the Design of Private Key Cryptosystems. 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_18
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_18
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