Software Performance of Universal Hash Functions
暂无分享,去创建一个
[1] Phillip Rogaway,et al. Bucket Hashing and Its Application to Fast Message Authentication , 1995, Journal of Cryptology.
[2] Thomas Johansson,et al. On Families of Hash Functions via Geometric Codes and Concatenation , 1993, CRYPTO.
[3] Gustavus J. Simmons,et al. A survey of information authentication , 1988, Proc. IEEE.
[4] Thomas Johansson,et al. Bucket Hashing with a Small Key Size , 1997, EUROCRYPT.
[5] Eli Biham,et al. Differential Cryptanalysis of the Data Encryption Standard , 1993, Springer New York.
[6] Gilles Brassard,et al. On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys , 1982, CRYPTO.
[7] Christian Gehrmann,et al. Fast Message Authentication Using Efficient Polynomial Evaluation , 1997, FSE.
[8] Ralph Howard,et al. Data encryption standard , 1987 .
[9] Mihir Bellare,et al. Incremental Cryptography: The Case of Hashing and Signing , 1994, CRYPTO.
[10] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[11] Mihir Bellare,et al. The Security of Cipher Block Chaining , 1994, CRYPTO.
[12] J. L. Massey,et al. An introduction to contemporary cryptology , 1988, Proc. IEEE.
[13] Bart Preneel,et al. MDx-MAC and Building Fast MACs from Hash Functions , 1995, CRYPTO.
[14] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[15] Ronald L. Rivest,et al. The MD5 Message-Digest Algorithm , 1992, RFC.
[16] Thomas Johansson,et al. On the cardinality of systematic authentication codes via error-correcting codes , 1996, IEEE Trans. Inf. Theory.
[17] Douglas R. Stinson. Universal Hashing and Authentication Codes , 1991, CRYPTO.
[18] Alfred Menezes,et al. Contemporary cryptology—The science of information integrity , 1994 .
[19] Mitsuru Matsui,et al. The First Experimental Cryptanalysis of the Data Encryption Standard , 1994, CRYPTO.
[20] Bart Preneel,et al. On the Security of Two MAC Algorithms , 1996, EUROCRYPT.
[21] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[22] Victor Shoup,et al. On Fast and Provably Secure Message Authentication Based on Universal Hashing , 1996, CRYPTO.
[23] Bart Preneel,et al. RIPEMD-160: A Strengthened Version of RIPEMD , 1996, FSE.
[24] Gustavus J. Simmons,et al. How to insure that data acquired to verify treaty compliance are trustworthy , 1988, Proc. IEEE.
[25] Mustafa Atici,et al. Universal Hashing and Multiple Authentication , 1996, CRYPTO.
[26] F. MacWilliams,et al. Codes which detect deception , 1974 .
[27] Mihir Bellare,et al. XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions , 1995, CRYPTO.
[28] Hugo Krawczyk,et al. Keying Hash Functions for Message Authentication , 1996, CRYPTO.
[29] Hugo Krawczyk,et al. LFSR-based Hashing and Authentication , 1994, CRYPTO.
[30] Hugo Krawczyk,et al. MMH: Software Message Authentication in the Gbit/Second Rates , 1997, FSE.
[31] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[32] Gustavus J. Simmons,et al. Contemporary Cryptology: The Science of Information Integrity , 1994 .
[33] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[34] Hugo Krawczyk,et al. New Hash Functions For Message Authentication , 1995, EUROCRYPT.
[35] Lars R. Knudsen,et al. Chosen-text attack on CBC-MAC , 1997 .
[36] Hugo Krawczyk,et al. UMAC: Fast and Secure Message Authentication , 1999, CRYPTO.