Logarithm Cartesian authentication codes

Information and Computation

Volumn 184, Issue 1, 2003, Pages 93-108

  Sze, T W ^a   Chanson, S ^a   Ding, C ^a   Helleseth, T ^b   Parker, M G ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Authentication codes; Cryptography; Cyclotomy

Indexed keywords

CRYPTOGRAPHY; FUNCTION EVALUATION; PROBABILITY; THEOREM PROVING;

LOGARITHM CARTESIAN AUTHENTICATION CODES; LOGARITHM FUNCTIONS;

CODES (SYMBOLS);

EID: 0038466305     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00053-1     Document Type: Article

References (14)

1. J. Bierbrauer, Universal hashing and geometric codes, Designs, Codes, and Cryptography 11 (1997) 207-221.
2. S. Chanson, C. Ding, A. Salomaa, Cartesian authentication codes from functions with optimal nonlinearity, Theoretical Computer Science 290 (2003) 1737-1752.
3. T.W. Cusick, C. Ding, A. Renvall, in: Stream Ciphers and Number Theory, North-Holland Mathematical Library, vol. 55, North-Holland/Elsevier, Amsterdam, 1998.
4. Y. Desmedt Y. Frankel M. Yung, Multi-sender network security: efficient authenticated multicast/feedback, in: Proceedings of IEEE Infocom '92, 1992, pp. 1045-2054.
5. E.N. Gilbert, F.J. MacWilliams, N.J.A. Sloane, Codes which detect deception, Bell System Techn. Journal 53 (1974) 405-424.
6. T. Helleseth, T. Johansson, Universal hash functions from exponential sums over finite fields and Galois rings, in: Advances in Cryptology - Crypto' 96, Lecture Notes in Computer Science, vol. 1109, Springer, New York, 1997.
7. K. Kurosawa, S. Obana, Characterization of (k, n) multi-receiver authentication, in: Information Security and Privacy: Proceedings of ACISP' 97, Lecture Notes in Computer Science, vol. 1270, Springer, New York, 1997, pp. 204-215.
8. R.S. Rees, D. R. Stinson, Combinatorial characterizations of authentication codes II, Design, Codes, and Cryptography 7 (1996) 239-259.
9. R. Safavi-Naini, H. Wang, New results on multi-receiver authentication codes, in: Advances in Cryptology: Proceedings of Eurocrypt' 98, Lecture Notes in Computer Science, vol. 1403, Springer, New York, 1998, pp. 527-541.
10. R. Safavi-Naini, H. Wang, Multi-receiver authentication codes: models, bounds, constructions, and extensions, Information and Computation 151 (1999) 148-172.
11. G.J. Simmons, Authentication theory/coding theor, in: Advances in Cryptology: Proceedings of Crypto' 84, Lecture Notes in Computer Science, vol. 196, Springer, New York, 1985, pp. 411-432.
12. D.R. Stinson, Combinatorial characterizations of authentication codes, Designs, Codes, and Cryptography 2 (1992) 175-187.
13. C. Xing, H. Wang, K.Y. Lam, Construction of authentication codes from algebraic curves over finite fields, IEEE Transactions on Information Theory 46 (2000) 886-892.
14. M.N. Wegman, J.L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences 22 (1981) 265-279.