On families of hash functions via geometric codes and concatenation

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

Volumn 773 LNCS, Issue , 1994, Pages 331-342

  Bierbrauer, Jürgen ^a   Johansson, Thomas ^b   Kabatianskii, Gregory ^c   Smeets, Ben ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b LUND UNIVERSITY   (Sweden)

^c INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; REED-SOLOMON CODES;

ALGEBRAIC CURVES; ARTIN-SCHREIER CURVE; AUTHENTICATION CODES; GEOMETRIC CODES; HERMITIAN CURVE; NEW CONSTRUCTIONS; UNIVERSAL HASH FUNCTION; UNIVERSAL HASHING;

CONCATENATED CODES;

EID: 84974696785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48329-2_28     Document Type: Conference Paper

References (20)

1. J.L. Carter, M.N. Wegman, “Universal Classes of Hash Functions”, J. Computer and System Set., Vol. 18, 1979, pp. 143-154.
2. D.R. Stinson, Combinatorial techniques for universal hashing, University of Nebraska-Lincoln. Department of Computer Science and Engineering, 1990.
3. G.J. Simmons, “A survey of Information Authentication”, in Contemporary Cryptology, The science of information integrity, ed. G.J. Simmons, IEEE Press, New York, 1992.
4. M.N. Wegman, J.L. Carter, “New hash functions and their use in authentication and set equality”, J. Computer and System Sciences, Vol. 22, 1981, pp. 265-279.
5. C.H. Bennett, G. Brassard, J-M. Roberts, “Privacy amplification by public discussion”, SIAM J.Comput., Vol. 17:2, 1988, pp. 210-229.
6. D.R. Stinson, “Universal Hashing and Authentication Codes”, to appear in IEEE Transactions on Information Theory. This is a final version of [7]
7. D. R. Stinson, “Universal hashing and authentication codes” Proceedings of Crypto 91, Santa Barbara, USA, 1991, pp. 74-85.
8. T. Johansson, G. Kabatianskii, B. Smeets, “On the relation between A-codes and codes correcting independent errors” Proceedings Eurocrypt’93, to appear.
9. J. Bierbrauer, “Universal hashing and geometric codes”, manuscript.
10. G.D. Forney, Jr., Concatenated Codes, M.I.T. Press, Cambridge, MA., 1966.
11. J. Bierbrauer, “Construction of orthogonal arrays”, to appear in Journal of Sta-tistical Planning and Inference.
12. T. Beth, D. Jungnickel, H. Lenz, Design Theory, Bibliographisches Institut, Zurich 1985.
13. M.A. Tsfasman, S.G. Vlädut, Algebraic-Geometric codes, Kluwer Academic Publ., Dordrecht/Boston/London, 1991.
14. R. Pellikaan, B.Z. Shen, and G.J.M. van Wee, “Which linear codes are algebraic-geometric?”, IEEE Trans. Information Theory, Vol. 37, 1991, pp. 583-602.
15. B.H. Matzat, “Kanonische Codes auf einigen Uberdeckungskurven”, Manuscripta Mathematica, Vol. 77, 1992, pp. 321-335.
16. L. Gargano, J. Körner, U. Vaccaro, “Spemer capacities”, to appear in Graphs and Combinatorics.
17. L. Gargano, J. Körner, U. Vaccaro, “Capacities: from information theory to extremal set theory”, to appear in Journal of the AMS.
18. J.P. Hansen, H. Stichtenoth, “Group Codes on Certain algebraic curves with many rational points”, AAECC, Vol. 1, 1990, pp. 67-77.
19. A. Garcia, S.J. Kim, R.F. Lax, “Consecutive Weierstrass gaps and minimum distance of Goppa codes”, Journal of Pure and Applied Algebra, Vol. 84, 1993, pp. 199207.
20. G. Kabatianskii, B. Smeets, T. Johansson, “Bounds on the size of a-codes and families of hash functions via coding theory”, manuscript.