Geodesic
On a family of universal hash functions
Matematičeskie voprosy kriptografii, Tome 6 (2015) no. 3, pp. 135-151 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We construct a new family of compressing mappings by means of superposition of several bijective mappings and mappings with specified properties. All functions in this family are proved to be universal hash functions. Concrete examples of functions from the family which are suitable for cryptographic applications are supplied. 
@article{MVK_2015_6_3_a7,
     author = {A. Yu. Nesterenko},
     title = {On a~family of universal hash functions},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {135--151},
     year = {2015},
     volume = {6},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MVK_2015_6_3_a7/}
}
TY  - JOUR
AU  - A. Yu. Nesterenko
TI  - On a family of universal hash functions
JO  - Matematičeskie voprosy kriptografii
PY  - 2015
SP  - 135
EP  - 151
VL  - 6
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MVK_2015_6_3_a7/
LA  - ru
ID  - MVK_2015_6_3_a7
ER  - 
%0 Journal Article
%A A. Yu. Nesterenko
%T On a family of universal hash functions
%J Matematičeskie voprosy kriptografii
%D 2015
%P 135-151
%V 6
%N 3
%U http://geodesic.mathdoc.fr/item/MVK_2015_6_3_a7/
%G ru
%F MVK_2015_6_3_a7
A. Yu. Nesterenko. On a family of universal hash functions. Matematičeskie voprosy kriptografii, Tome 6 (2015) no. 3, pp. 135-151. http://geodesic.mathdoc.fr/item/MVK_2015_6_3_a7/

[1] Alferov A. P., Zubov A. Yu., Kuzmin A. S., Cheremushkin A. V., Osnovy kriptografii, Uchebnoe posobie, Gelios ARV, M., 2001, 480 pp.

[2] Ilyasov I. I., “K raspredeleniyu prostykh chisel v mnogochlenakh vtoroi stepeni s tselymi koeffitsientami”, Chebyshevskii sbornik, 14:1 (2013), 56–60 | MR

[3] Lebedev P. A., Nesterenko A. Yu., “Rezhim shifrovaniya s vozmozhnostyu autentifikatsii”, Sistemy vysokoi dostupnosti, 9:3 (2013), 6–13

[4] Nesterenko Yu. V., Teoriya chisel, Akademiya, M., 2008, 272 pp.

[5] Serpinskii V., O reshenii uravnenii v tselykh chislakh, Izd-vo fiz.-mat. lit., M., 1961, 88 pp.

[6] B. A. Pogorelov, V. N. Sachkov (red.), Slovar kriptograficheskikh terminov, MTsMNO, M., 2006, 94 pp.

[7] Bellare M., Canetti R., Krawczyk H., “HMAC: Keyed-hashing for message authentication”, Internet Engineering Task Force, Request for Comments (RFC) 2104, February 1997

[8] Black J., Halevi S., Krawczyk H., Krovetz T., Rogaway P., “UMAC: Fast and secure message authentication”, CRYPTO' 99, Lect. Notes Comput. Sci., 1666, 1999, 216–233 | DOI | MR | Zbl

[9] Black J., Rogaway P., “CBC MACs for arbitrary-length messages: The three-key constructions”, CRYPTO 2000, Lect. Notes Comput. Sci., 1880, 2000, 197–215 | DOI | MR | Zbl

[10] Boesgaard M., Scavenius O., Pedersen T., Christensen T., Zenner E., “Badger – a fast and provably secure MAC”, Appl. cryptogr. network secur. 3rd Int. Conf., ACNS 2005, Lect. Notes Comput. Sci., 3531, 2005, 176–191 | DOI | Zbl

[11] Carter J. L., Wegman M. N., “Universal classes of hash functions”, J. Comput. Syst. Sci., 18 (1979), 143–154 | DOI | MR | Zbl

[12] Etzel M., Patel S., Ramzan Z., “Square Hash: Fast message authentication via optimized universal hash functions”, CRYPTO' 99, Lect. Notes Comput. Sci., 1666, 1999, 234–251 | DOI | MR | Zbl

[13] FIPS PUB 198-1. Computer Security. Cryptography. The Keyed-Hash Message Authentication Code (HMAC), 2008, 13 pp.

[14] Halevi S., Krawczyk H., “MMH: software message authentication in the Gbit/second rates”, FSE' 97, Lect. Notes Comput. Sci., 1267, 1997, 172–189 | DOI

[15] Handschuh H., Preneel B., “Key-recovery attacks on universal hash function based MAC algorithms”, CRYPTO 2008, Lect. Notes Comput. Sci., 5157, 2008, 144–161 | DOI | MR | Zbl

[16] Iwata T., Kurosawa K., “OMAC: One-key CBC MAC”, FSE 2003, Lect. Notes Comput. Sci., 2887, 2003, 129–153 | DOI | MR | Zbl

[17] Krovetz T., “Message authentication on 64-bit architectures”, SAC 2006, Lect. Notes Comput. Sci., 4356, 2007, 327–341 | DOI | Zbl

[18] Nandi M., On the minimum number of multiplications necessary for universal hash constructions, IACR Cryptology ePrint Archive, No 574, 2013

[19] Preneel B., Analysis and design of cryptographic hash functions, Doct. diss., Katholieke Univ. Leuven, 1993

[20] Stinson D. R., “Universal hashing and authentication codes”, CRYPTO 91, 1991, 74–85 | MR

[21] Stinson D. R., “Universal hashing and message authentication codes”, Des., Codes and Cryptogr., 4:4 (1994), 369–380 | DOI | MR | Zbl

[22] Wegman M. N., Carter J. L., “New hash functions and their use in authentication and set equality”, J. Comput. Syst. Sci., 22:3 (1981), 265–279 | DOI | MR | Zbl