Abstract
We survey a recent application of algebraic curves over finite fields to the constructions of authentication codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Bierbrauer, “Universal hashing and geometric codes”, Designs, Codes and Cryptography, Vol.11, pp. 207–221, 1997.
J. Bierbrauer, T. Johansson, G. Kabatianskii and B. Smeets, “On families of hash functions via geometric codes and concatenation”, Advances in CryptologyCRYPTO’93,Lecture Notes in Computer Science,773, pp. 331–342, 1994.
J. L. Carter and M. N. Wegman, “Universal classes of hash functions”, J. Computer and System Sci., Vol.18, pp. 143–154, 1979.
A. Garcia and H. Stichtenoth, “On the asymptotic behavior of some towers of function fields over finite fields”, J. of Number Theory, Vol.61, pp. 248–273, 1996.
E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, “Codes which detect deception”, The Bell System Technical Journal, Vol.33, No.3, pp. 405–424, 1974.
T. Helleseth and T. Johansson, “Universal hash functions from exponential sums over finite fields and Galois Rings”, Advances in Cryptology-Crypto’96, Lecture Notes in Computer Science, 1109, pp. 31–44, 1996.
T. Johansson, Contributions to unconditionally secure authentication, Ph.D. thesis, Lund, 1994.
G. Kabatianskii, B. Smeets, and T. Johansson, “On the cardinality of systematic authentication codes via error correctings”, IEEE Trans. Inform. Theory, Vol. 42, pp. 566–578, 1996.
J.-P. Serre, Rational points on curves over finite fields,lecture notes, Harvard
G J Simmons, “Authentication theory/coding theory”, Advances in CryptologyCrypto ‘84, Lecture Notes in Computer Science, 196, pp. 411–431, 1984.
G J Simmons, “A survey of information authentication”, in Contemporary Cryptology, The Science of Information Integrity, G.J. Simmons, ed., IEEE Press, pp. 379–419, 1992.
H. Stichtenoth, Algebraic function fields and codes, Berlin: Springer-Verlag, 1993.
D. R. Stinson, “Combinatorial characterization of authentication codes”, Designs, Codes and Cryptography, Vol. 2, pp. 175–187, 1992.
D. R. Stinson, “Universal hashing and authentication codes”, Designs,Codes and Cryptography, Vol. 4, pp. 377–346, 1994. (also Advances in Cryptology-CRYPTO ‘81, Lecture Notes in Computer Sci. 576, pp. 74–85, 1992.)
D. R. Stinson, “On the connection between universal hashing, combinatorial designs and error-correcting codes”, Congressus Numerantium, Vol. 114, pp. 7–27, 1996.
M. A. Tsfasman and S. G. Vladut, Algebraic-geometric codes, Dordrecht: Kluwer, 1991.
W. C. Waterhouse, “Abelian varieties over finite fields”, Ann. Sci. Ecole Norm. Sup., Vol. 2, pp. 521–560, 1969.
M. N. Wegman and J. L. Carter, “New hash functions and their use in authentication and set equality”, Journal of Computer and System Sciences, Vol. 22, pp. 265–279, 1981.
C. P. Xing and H. X. Wang, and K. Y. Lam, “Constructions of authentication codes from algebraic curves over finite fields,” IEEE Trans. Inform. Theory, Vol. 48, pp. 886–892, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Basel AG
About this paper
Cite this paper
Xing, C. (2001). Authentication Codes and Algebraic Curves. In: Casacuberta, C., Miró-Roig, R.M., Verdera, J., Xambó-Descamps, S. (eds) European Congress of Mathematics. Progress in Mathematics, vol 202. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8266-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8266-8_19
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9496-8
Online ISBN: 978-3-0348-8266-8
eBook Packages: Springer Book Archive