Author:
Bakhtiari S.,Safavi-Naini R.,Pieprzyk J.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. 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.
2. 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.
3. C. J. Colbourn, M. J. Colbourn, and D. R. Stinson, “The Computational Complexity of Recognizing Critical Sets,” in First Southeast Asian Graph Theory Colloquium, vol. 1073 of Lecture Notes in Mathematics, pp. 248–253, 1984.
4. C. J. Colbourn and J. H. Dinitz, The CRC Handbook of Combinatorial Designs, ch. 2, pp. 95–182. CRC, 1996.
5. J. Cooper, D. Donovan, and J. Seberry, “Latin Squares and Critical Sets of Minimal Size,” Australasian Journal of Combinatorics, vol. 4, pp. 113–120, 1991.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献