A Message Authentication Code Based on Latin Squares
暂无分享,去创建一个
Josef Pieprzyk | Reihaneh Safavi-Naini | Shahram Bakhtiari | J. Pieprzyk | R. Safavi-Naini | S. Bakhtiari
[1] Hugo Krawczyk,et al. LFSR-based Hashing and Authentication , 1994, CRYPTO.
[2] T. P. McDonough,et al. Critical sets in nets and latin squares , 1994 .
[3] Ed Dawson,et al. Quasigroups, isotopisms and authentication schemes , 1996, Australas. J Comb..
[4] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[5] A. Donald Keedwell,et al. A new authentication scheme based on latin squares , 1992, Discret. Math..
[6] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[7] Hugo Krawczyk,et al. New Hash Functions For Message Authentication , 1995, EUROCRYPT.
[8] J. Dénes,et al. Latin squares and their applications , 1974 .
[9] Charles J. Colbourn,et al. The computational complexity of recognizing critical sets , 1984 .
[10] Phillip Rogaway. Bucket Hashing and its Application to Fast Message Authentication , 1995, CRYPTO.
[11] Thomas Johansson,et al. Authentication codes for nontrusting parties obtained from rank metric codes , 1995, Des. Codes Cryptogr..
[12] Jennifer Seberry,et al. Latin squares and critical sets of minimal size , 1991, Australas. J Comb..
[13] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.
[14] Richard Taylor,et al. Near Optimal Unconditionally Secure Authentication , 1994, EUROCRYPT.
[15] Victor Shoup,et al. On Fast and Provably Secure Message Authentication Based on Universal Hashing , 1996, CRYPTO.
[16] A. D. Keedwell,et al. Latin Squares: New Developments in the Theory and Applications , 1991 .
[17] Douglas R. Stinson,et al. Universal hashing and authentication codes , 1991, Des. Codes Cryptogr..
[18] Ivan Damgård,et al. A Design Principle for Hash Functions , 1989, CRYPTO.