Keyed hash functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1029, Issue , 1996, Pages 201-214

  Bakhtiari, S ^a   Safavi Naini, R ^a   Pieprzyk, J ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION;

AUTHENTICATION CODES; CARTESIANS; KEYED HASH FUNCTIONS; SECURE MESSAGES; UNIVERSAL HASH FUNCTION;

HASH FUNCTIONS;

EID: 77955516185     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. R. Anderson, "The Classification of Hash Functions," in Codes and Guphers-Proceedings of Cryptography and Coding IV, (Essex, UK), pp. 83-93, Institute of Mathematics and its Applications (IMA), 1995.
2. S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, "Cryptographic Hash Functions: A Survey," Tech. Rep. 95-09, Department of Computer Science, University of Wollongong, July 1995.
3. S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, "Practical and Secure Message Authentication," in Series of Annual Workshop on Selected Areas in Cryptography (SAC '95), (Ottawa, Canada), pp. 55-68, May 1995.
4. T. A. Berson, L. Gong, and T. M. A. Lomas, "Secure, Keyed, and CoUisionful Hash Functions," Tech. Rep. (included in) SRI-CSL-94-08, SRI International Laboratory, Menlo Park, California, Dec. 1993. The revised version (September 2, 1994).
5. J. L. Carter and M. N. Wegman, "Universal Class of Hash Functions," Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143-154, 1979.
6. C. Charnes and J. Pieprzyk, "Linear Nonequivalence versus Nonlinearity," in Advances in Cryptology, Proceedings of AUSCRYPT '92, pp. 156-164, Dec. 1992.
7. D. Knuth, The Art of Computer Programming: Searching and Sorting, vol. 3. Addison-Wesley, 1973.
8. M. Luby and C. RackofF, "How to Construct Pseudorandom Permutations and Pseudorandom Functions," SIAM Journal on Computing, vol. 17, pp. 373-386, Apr. 1988.
9. National Bureau of Standard, Data Encryption Standard. FIPS publication 46, June 1977. U. S. Department of Commerce.
10. B. Preneel, Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke University Leuven, Jan. 1993.
11. R. L. Rivest, "The MD5 Message-Digest Algorithm." RFC 1321, Apr. 1992. Network Working Group, MIT Laboratory for Computer Science and RSA Data Security, Inc.
12. R. Safavi-Naini and L. Tombak, "Combinatorial Characterization of A-Codes with r-Fold Security," in Advances in Cryptology, Proceedings of ASIACRYPT '94, vol. 917 of Lecture Notes in Computer Science (LNCS), pp. 211-223, Springer-Verlag, 1995.
13. G. J. Simmons, "Authentication Theory/Coding Theory," in Advances in Cryptology, Proceedings of CRYPTO '84, vol. 196 of Lecture Notes in Computer Science (LNCS), pp. 411-431, Springer-Verlag, 1985.
14. T. V. Trung, "Universal Hashing and Unconditional Authentication Codes," in Proceedings of the IEEE International Symposium on Information Theory, p. 228, 1993.
15. M. N. Wegman and J. L. Carter, "New Hash Functions and Their Use in Authentication and Set Equality," Journal of Computer and System Sciences, vol. 22, pp. 265-279, 1981.
16. Y. Zheng, Principles for Designing Secure Block Ciphers and One-Way Hash Functions. PhD thesis, Electrical and Computer Engineering, Yokohama National University, Dec. 1990.
17. Y. Zheng, J. Pieprzyk, and J. Seberry, "HAVAL-A One-Way Hashing Algorithm with Variable Length of Output," in Advances in Cryptology, Proceedings of AUSCRYPT '92, vol. 718 of Lecture Notes in Computer Science (LNCS), (Queensland, Australia), pp. 83-104, Springer-Verlag, Dec. 1992.