350 rub
Journal Neurocomputers №12 for 2012 г.
Article in number:
Application of neural networks to assess the quality of the hash function
Authors:
N.I. Chervyakov, A.A. Yevdokimov, E.V. Maslennikova
Abstract:
Persistence of data integrity, message authentication and generation mechanisms alias to create secure applications for the transmission of multimedia messages over the Internet relies on the quality of algorithms for constructing the message digest, used in the creation/verification of digital signatures. In this work the tests based on neural network for qualitative evaluation of the function of the message digest. In practice there is a lack of practical tests to be applied to the message digest algorithm for constructing an ever-growing field of systems engineering and communications security, especially for the transmission of the information content of multimedia data, where the problems of copyright protection and security in the transactions are particularly acute. The proposed assessment tests are considered together with others, obtained using statistical methods and information theory such as entropy test, and thus is a suitable methodology for the practical assessment. With the help of these tests have been tested algorithms MD5 and SHA, and the obtained results show the good quality of the algorithms. Required computation time is not so large that would limit their use on modern computers.
Pages: 11-17
References
  1. Damgard, I.B., Collision Free Hash Functions and Public Key Signature Schemes. Advances in Cryptography, Eurocrypt-87, Lecture Notes in Computer Science 304, Springer Verlag. 1987. P. 203-216.
  2. Damgard, L B., A Design Principle for Hash Functions. Advances in Cryptography, Crypto-89, Lecture Notes in Computer Science 435. Springer Verlag, 1989. P. 416-427.
  3. Preenel, B., Cryptographic Hash Functions. Transactions on Telecommunications. V. 5. 1994. P. 431-448.
  4. Wegman, M. N., Carter, J. L., New Hash Functions and Their Use in Authentication and Set Quality. J. of Computer and System Sciences. V. 22. 1981. P. 265-279.
  5. Schneier, B., Applied Cryptography, John Willcy and Sons. 1996.
  6. Peyravian, M., Roginsky, A., Kshemkalyani, A., On Probabilities of Hash Value Matches. J. Computers & Security. 1998.  V. 17. № 2. P. 171-176.
  7. Stinson, D.,Combinatorial Techniques for Universal Hashing. J. of Computer and System Sciences. 1994. V. 48. P. 337-346.
  8. Stallings, W., Network and Internetwork Security, Prentice Hall. 1995.
  9. Pfleeger, C. P., Security in Computing, Prentice Hal. 1997.
  10. Simmons, G. J. (editor). Contemporary Cryptology, The Science of Information Integrity // IEEE Press. 1992.
  11. FIPS PUB 180-1. Secure Hash Standard. 1995.
  12. Dawson, E. P, and Gustafson, H. M., A method for measuring entropy of symmetric cipher key generators. J. of Computers & Security. 1998. V. 17. № 2. P. 177-184.
  13. Patterson, D. W., Artificial Neural Networks. Theory and Applications. Prentice Hall. 1996.