A model to order the encryption algorithms according to their quality

ABSTRACT

Usually the unicity distance is used to give the strength of encryption algorithms. In this work, the behaviour of encipherment algorithm has been analyzed and two different parameters are proposed in order to evaluate the quality. These parameters are checked against the unicity distance and a final test has been executed, using DES.

REFERENCES

• 1: (Bradnstad et al. 76) Brandstad D. K., Cait J., Katzke S. "Report of the workshop on cryptography support of computer security". N. B. S. 77-1291. 1976.
• 2: Peter J. Denning , David H. Brandin , Daniel C. Schwartz , George I. Davida, Report of the public cryptography study group, Communications of the ACM, v.24 n.7, p.434-450, July 1981 [doi>10.1145/358699.358710]
• 3: Dorothy E. Denning , Giovanni Maria Sacco, Timestamps in key distribution protocols, Communications of the ACM, v.24 n.8, p.533-536, Aug. 1981 [doi>10.1145/358722.358740]
• 4: (Diff, 76) Diffie, V., and Bellman, M. "New directions in criptography". IEEE Transactions of Info Theory. Vol. IT-22. 1976.
• 5: (Diffie and Bellman, 79) Diffie, W., and Bellman, M. "Privacy and Authentication: An introduction to Criptography". Proc. of IEEE, Vol. 67 no. 3, 1979.
• 6: (Ehrsam et al., 78) Ehrsam W. F., Matyas S. M., Meyer C. H., Tuchman W. I. "A cryptographic key management Scheme for implementing the Data Encription Standard". IBM Syst. J. Vol. 17 no. 2, 1978.
• 7: (Everton, 78) Everton J. K. "A hierarchical basis for encryption key management in a computer communications network". Trends and applications 1978. Distributed processing. IEEE Computer Society. 1978.
• 8: (Feistel, 70) Feistel H. "Cryptographic Coding for Data-Bank Privacy". T. J. Watson Research Center. Yorktown Heights. 1970.
• 9: (Feistel, 73) Feistel H. "Cryptography and Computer Privacy". Sci. Am. Vol. 228, 1973.
• 10: (Feistel et al. 75) Feistel H., Notz W., Smith J. "Some cryptographic Techniques for machine to machine Data Communications". Proceedings of IEEE, Vol. 63, no. 11, 1975.
• 11: Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
• 12: (Hellman et al. 76) Hellman M., Merkle R., Schroeppel R., et al. "Results of an initial attempt to cryptanalyze the NBS data encryption standard". Information Systems Laboratory. 1976.
• 13: (Hill, 29) Hill L. S. "Am. Moth. Mon.". 1929.
• 14: Ellis Horowitz , Sartaj Sahni, Computing Partitions with Applications to the Knapsack Problem, Journal of the ACM (JACM), v.21 n.2, p.277-292, April 1974 [doi>10.1145/321812.321823]
• 15: (I. B. M. 78) I. B. M. System Journal. Vol. 17-2. "Monographic publication on cryptography". 1978.
• 16: Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
• 17: (Kohnfelder, 78) Kohnfelder L. "Towards a practical public key cryptosystems". B. S. Thesis. M. I. T. Cambridge, Mass. 1978.
• 18: (Krishnamurthy, 70) Krishnamurthy E. V. "Computer criptographic techniques for processing and storage of confidential information". Int. J. Control, Vol. 12, no. 5, 1970.
• 19: (Le Ve, 77) Le Veque W. J. "Fundamentals of number theory". Addison-Wesley Reading-Mass. 1977.
• 20: Abraham Lempel, Cryptology in Transition, ACM Computing Surveys (CSUR), v.11 n.4, p.285-303, Dec. 1979 [doi>10.1145/356789.356792]
• 21: (Martin Hellman, 77) Hellman M. E. "An extension of the Shannon Theory approach to cryptography". IEEE Trans. Inf. Theory. IT-23, 3. 1977.
• 22: (Martin Hellman, 79) Martin E. Hellman. "A primer on trapdoord, time-memory tradeoff and knapsacks". IEEE spectrum. 1979.
• 23: Ralph C. Merkle, Secure communications over insecure channels, Communications of the ACM, v.21 n.4, p.294-299, April 1978 [doi>10.1145/359460.359473]
• 24: (Merkle and Hellman, 78) Merkle R. C., Hellman M. E. "Hiding information and signatures in trapdoor knapsacks". IEEE Trans. Info. Theory. IT-24, 5. 1978.
• 25: Ralph C. Merkle , Martin E. Hellman, On the security of multiple encryption, Communications of the ACM, v.24 n.7, p.465-467, July 1981 [doi>10.1145/358699.358718]
• 26: (Moreyra, C. 64) Moreyra, Carlos A. "Los Criptogramas de Sta. Teresa". Dean Funes, Córdoba - Argentina. 1964.
• 27: (Morris et al., 77) Morris R., Sloone N. J. A., Wyner A. D. "Assessment of the National Bureau of Standards proposed federal data encryption standard". Criptologia 1, 1977.
• 28: Roger M. Needham , Michael D. Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM, v.21 n.12, p.993-999, Dec. 1978 [doi>10.1145/359657.359659]
• 29: W. H. Payne , K. L. McMillen, Orderly enumeration of nonsingular binary matrices applied to text encryption, Communications of the ACM, v.21 n.4, p.259-263, April 1978 [doi>10.1145/359460.359464]
• 30: (Peterson and Weldon,72) Peterson W. and Weldon E. J. "Error Correcting Codes, Second Edition". Cambridge, M. A. MIT Press. 1972.
• 31: (Pohlig and Hellman,78) Pohlig S. D., Hellman M. E. "An improved algorithm for computing logarithms in GF (P) and its cryptographic significance". IEEE Trans. Inf. Theory, Vol. IT-24. 1978.
• 32: (Pratt, F. 40) Pratt, Fletcher. "Historia de la Criptografia". Biblioteca Nacional - Madrid.
• 33: R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]
• 34: Dorothy Elizabeth Robling Denning, Cryptography and data security, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1982
• 35: (Rodríguez, 81) Rodríguez A. "Medida de eficiencia y complejidad de algoritmos de comprensión: Aplicación a Base de datos". Facultad de Informática. Universidad Politécnica de Madrid. 1981.
• 36: (Rodríguez, 83) Rodríguez A. "Cifrado de información para uso en modo no transparente". Novática, Vol. IX. 1983.
• 37: (Sancho, 79) Sancho J. "Diseñio de métodos criptográficos para la protección de a información en sistemas ordenadores". Escuela Técnica Superior de Ingenieros de Telecomunicación. 1979.
• 38: (Schroeppel, 79) Schroeppel R., Shamir A. "A. T. S² = O (2ⁿ) Time/Space trade off for certain SP- complete problems". MIT Lab. Computing Sci. Rep. 1979.
• 39: (Shamir, 78) Shamir A. "A fast signature sheme Tech memo". MIT/LCS/TM-107. MIT, Cambridge Mass. 1978.
• 40: Adi Shamir, On the cryptocomplexity of knapsack systems, Proceedings of the eleventh annual ACM symposium on Theory of computing, p.118-129, April 30-May 02, 1979, Atlanta, Georgia, United States [doi>10.1145/800135.804405]
• 41: (Shannon, 49) Shannon C. "Communication theory of secrecy systems". Bell Syst. Tech. J, Vol. 28 - 1949.
• 42: Gustavus J. Simmons, Symmetric and Asymmetric Encryption, ACM Computing Surveys (CSUR), v.11 n.4, p.305-330, Dec. 1979 [doi>10.1145/356789.356793]
• 43: (Tuchman, 78) Tuchman W. L. "Talk presented at the Nat. Computer Conf". Anaheim, C. A. 1978.
• 44: (Turing, 36) Turing A. "On computable numbers with an application to the Entscheidungsproblem". Proc. London Math. Soc. Ser. 2. Vol. 42, Vol. 43. 1936.
• 45: (Way, P. 77) Way Peter. "Codes and Ciphers". Aldus Books Limited 1977 - U. K.

INDEX TERMS

Primary Classification:
  E. Data
  E.3 DATA ENCRYPTION

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Modeling techniques

  D. Software
  D.4 OPERATING SYSTEMS
      D.4.6 Security and Protection
          Subjects: Cryptographic controls

General Terms:
Algorithms, Design, Security