A Layered Approach to the Design of Private Key Cryptosystems

  • T. E. Moore
  • S. E. Tavares
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 218)

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.

8. References

  1. [1]
    Akl, S.G. and Meijer, H., “Two New Secret Key Encryption Algorithms”, presented at Eurocrypt’ 85, Linz, Austria, Apr. 1985.Google Scholar
  2. [2]
    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.MathSciNetGoogle Scholar
  3. [3]
    “Data Encryption Standard”, FIPS PUB 46, National Bureau of Standards, Washington, D.C., Jan. 1977.Google Scholar
  4. [4]
    Davies, D.W., “Some Regular Properties of the DES”, Advances in Cryptology: Proceedings of Crypto’ 82, pp. 89–96, Plenum Press, 1983.Google Scholar
  5. [5]
    Denning, D.E., Cryptography and Data Security, Addison-Wesley, Reading, Mass., 1982.MATHGoogle Scholar
  6. [6]
    Feistel, H., “Cryptography and Computer Privacy”, Sci. Am., Vol. 228, pp. 15–23, May 1973.CrossRefGoogle Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    Knuth, D., The Art of Computer Programming; Vol. 2, Seminumerical Algorithms, Addison-Wesley, Reading, Mass., 1969.MATHGoogle Scholar
  10. [10]
    Konheim, A.G., Cryptography: A Primer, John Wiley and Sons, New York, 1981.MATHGoogle Scholar
  11. [11]
    Lempel, A. and Ziv, J., “On the Complexity of Finite Sequences”, IEEE Trans. on Info. Theory, Vol. 10–22, pp. 75–81, Jan. 1976.CrossRefMathSciNetGoogle Scholar
  12. [12]
    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.Google Scholar
  13. [13]
    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.MATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    Shannon, C.E., “Communication Theory of Secrecy Systems”, Bell Syst. Tech. J., Vol. 28, pp. 656–715, Oct. 1949.MathSciNetMATHGoogle Scholar
  15. [15]
    Spencer, M.E. and Tavares, S.E., “Layered Broadcast Cryptographic Systems”, Advances in Cryptology: Proceedings of Crypto’ 83, pp. 157–170, Plenum Press, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • T. E. Moore
    • 1
  • S. E. Tavares
    • 1
  1. 1.Department of Electrical EngineeringQueen’s UniversityKingstonCanada

Personalised recommendations